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