codeforce 621A Wet Shark and Odd and Even

水

最大偶数和

#include<iostream>
#include<string>
#include<algorithm>
#include<cstdlib>
#include<cstdio>
#include<set>
#include<map>
#include<vector>
#include<cstring>
#include<stack>
#include<cmath>
#include<queue>
#include <bits/stdc++.h>
using namespace std;
#define INF 0x3f3f3f3f
#define ll long long
#define clc(a,b) memset(a,b,sizeof(a))
const int maxn=400010;

int main()
{
    int n;
    scanf("%d",&n);
    ll x;
    ll sum=0;
    ll y=INF;
    for(int i=0; i<n; i++)
    {
        scanf("%I64d",&x);
        sum+=x;
        if(x%2)
            y=min(y,x);
    }
//    cout<<sum<<endl;
    if(sum%2)
        sum=sum-y;
    printf("%I64d
",sum);
    return 0;
}