codeforces/1049.cpp at master · chamodhk/codeforces · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
#include <bits/stdc++.h>
using namespace std;

int main() {
    int t; cin >> t;
    while(t--) {
        int n; cin >> n;
        vector<int> a(n);

        vector<int> a0;
        vector<int> a1;

        for (int i =0 ; i < n; i++){
            cin >> a[i];
            if (a[i] % 2 == 1){
                a0.push_back(a[i]);
            } else {
                a1.push_back(a[i]);
            }
        }
        long long ans = 0;
        int odd_count = a0.size();

        if (odd_count){
            for (int i: a1){
                ans += i;
                // cout << i << " ";
            }

            sort(a0.begin(), a0.end(), greater<int>());


            for (int i = 0; i < (odd_count + 1)/2;i++){
                ans += a0[i];
            }


            cout << ans << "\n";
        } else {

            cout << 0 << "\n";
        }


    }
}