Monday, February 1, 2016

Codeforces Round #341 (Div. 2


প্রবলেমটি পড়ুন এবং বুঝুন


#include<iostream>
#include<algorithm>

using namespace std;

int main()
{
    long int n;
    while(cin>>n)
    {
        long int a[n],b,k=0;
        unsigned long long int sum=0;
        for(int i=0;i<n;i++)
        {
            cin>>b;
            sum+=b;
            if(b%2!=0)
            {
                a[k]=b;
                k++;
            }
        }
        sort(a,a+k);
        if(sum%2!=0)
            sum-=a[0];
        cout<<sum<<endl;
    }
    return 0;
}


No comments:

Post a Comment