【CodeForces 621A】Wet Shark and Odd and Even

1585 단어
제목
Today, Wet Shark is given n integers. Using any of these integers no more than once, Wet Shark wants to get maximum possible even (divisible by 2) sum. Please, calculate this value for Wet Shark.
Note, that if Wet Shark uses no integers from the n integers, the sum is an even integer 0.
Input
The first line of the input contains one integer, n (1 ≤ n ≤ 100 000). The next line contains n space separated integers given to Wet Shark. Each of these integers is in range from 1 to 109, inclusive.
Output
Print the maximum possible even sum that can be obtained if we use some of the given integers.
Sample test(s)
input
3
1 2 3

output
6

input
5
999999999 999999999 999999999 999999999 999999999

output
3999999996

Note
In the first sample, we can simply take all three integers for a total sum of 6.
In the second sample Wet Shark should take any four out of five integers 999 999 999.
제목의 뜻
n개수의 서열의 합에서 최대 짝수와 합을 구하다.
분석하다.
만약 n개의 수를 합쳐서 짝수라면 직접 출력하고, 그렇지 않으면 가장 작은 홀수를 뺀다.
코드
#include<stdio.h>
long long n,a,minj=1e9+1,sum;
int main(){
    scanf("%I64d",&n);
    for(int i=0;i<n;i++)
    {
        scanf("%I64d",&a);
        if(a%2 && a<minj) minj=a;
        sum+=a;
    }
    if(sum%2) sum-=minj;
    printf("%I64d
",sum); return 0; }

좋은 웹페이지 즐겨찾기