Submission #35485344

---

Source Code Expand

#include <bits/stdc++.h>
typedef long long ll;
const int INF = 1e9;
const int MOD = 1e9+7;
const ll LINF = 1e18;
using namespace std;
//ここからメイン
int H, W;
vector<vector<char>> MAP;
vector<vector<bool>> res(16, vector<bool>(16));
int MAX = -1;

    
int main() {
    ll N;
    cin >> N;
    vector<ll>A(N);
    for (int i = 0; i < N; i++) {
        cin >> A[i];
    }
    if (N == 2 && (A[0] + A[1]) % 2 == 1)cout << -1 << endl;
    else {
        vector <ll> odd, even;
        for (int i = 0; i < N; i++) {
            if (A[i] % 2 == 1)odd.push_back(A[i]);
            else even.push_back(A[i]);

        }
        sort(odd.begin(), odd.end());
        sort(even.begin(), even.end());
        ll o_s = odd.size();
        ll e_s = even.size();
        ll OM, EM;
        if (o_s < 2) {
            OM = -1;
        }
        else {
            OM = odd[o_s - 1] + odd[o_s - 2];
        }
        if (e_s < 2) {
            EM = -1;
        }
        else {
            EM = even[e_s - 1] + even[e_s - 2];
        }
        cout << max(OM, EM) << endl;

    }
    return 0;
}

Submission Info

Judge Result