fork(1) download
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3.  
  4. void solve() {
  5. int n;
  6. cin >> n;
  7.  
  8. long long total_sum = 0;
  9. vector<int> odd_numbers;
  10.  
  11. for (int i = 0; i < n; ++i) {
  12. int current_number;
  13. cin >> current_number;
  14. if (current_number % 2 == 0) {
  15. total_sum += current_number;
  16. } else {
  17. odd_numbers.push_back(current_number);
  18. }
  19. }
  20.  
  21. sort(odd_numbers.begin(), odd_numbers.end());
  22.  
  23. int odd_count = odd_numbers.size();
  24. for (int i = odd_count / 2; i < odd_count; ++i) {
  25. total_sum += odd_numbers[i];
  26. }
  27.  
  28. cout << total_sum << endl;
  29. }
  30.  
  31. int main() {
  32. ios_base::sync_with_stdio(false);
  33. cin.tie(NULL);
  34.  
  35. int test_cases;
  36. cin >> test_cases;
  37. while (test_cases--) {
  38. solve();
  39. }
  40. return 0;
  41. }
Success #stdin #stdout 0.01s 5312KB
stdin
3
3
2 4 6
4
4 2 1 6
4
1000000000 999999999 1000000000 999999999
stdout
12
13
2999999999