CodeForces - 797B Odd sum

Odd sum

You are given sequence a1, a2, …, an of integer numbers of length n. Your task is to find such subsequence that its sum is odd and maximum among all such subsequences. It’s guaranteed that given sequence contains subsequence with odd sum.

Subsequence is a sequence that can be derived from another sequence by deleting some elements without changing the order of the remaining elements.

You should write a program which finds sum of the best subsequence.
Input

The first line contains integer number n (1 ≤ n ≤ 105).

The second line contains n integer numbers a1, a2, …, an ( - 104 ≤ ai ≤ 104). The sequence contains at least one subsequence with odd sum.
Output

Print sum of resulting subseqeuence.
Example
Input

4
-2 2 -3 1

Output

3

Input

3
2 -5 -3

Output

-1

Note

In the first example sum of the second and the fourth elements is 3.
不难的题目，却不知为何一直调不对，场下一次就做对了，唉都是泪

#include<bits/stdc++.h>
using namespace std;
int main()
{

    int n;
    int num[100005];
    int num2[100005];
    int x=0;int j=0;
    scanf("%d",&n);
    for(int i=0;i<n;i++)
        {
        scanf("%d",&num[i]);

        }
    int sum;
    for(int i=0;i<n;i++)
    {
        if(x<=x+num[i])
            {x+=num[i];
              num2[j++]=num[i];
            num[i]=0;
            }
    }
    if(x&1)
    cout<<x<<endl;
    else
    {   int x2=x;
        sort(num,num+n);
        sort(num2,num2+j);
        for(int i=0;i<j;i++)
        {
          if(num2[i]&1)
          {x2-=num2[i];break;}
        }

        for(int i=n-1;i>=0;i--)
        {
            if(num[i]&1)
            {
                x+=num[i];
                break;
            }
        }
    int x3=max(x,x2);
    if(x3&1)
    cout<<x3<<endl;
    else
    cout<<min(x,x2)<<endl;



    }


}