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=;

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