codeforces/1144B.cpp at master · nafisatuli/codeforces · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
#include<bits/stdc++.h>
using namespace std;
vector<int>odd;
vector<int>even;
int main()
{
    int n,x;
    cin >> n;
    for(int i=0; i<n; i++)
    {
        cin >> x;
        if(x%2==0)
        {
            even.push_back(x);
        }
        else
        {
            odd.push_back(x);
        }
    }
    int res=0,k=0;
    if(even.size()-odd.size()==0||(abs(even.size()-odd.size()))==0)
    {
        cout << 0 << endl;
        return 0;
    }
    if(odd.size()>even.size())
    {
        k=odd.size()-even.size()-1;
        sort(odd.begin(),odd.end());
        for(int i=0; i<k; i++)
        {
            res+=odd[i];
        }
        cout << res << endl;
        return 0;
    }
    else if(odd.size()<even.size())
    {
        k=even.size()-odd.size()-1;
        sort(even.begin(),even.end());
        for(int i=0; i<k; i++)
        {
            res+=even[i];
        }
        cout << res << endl;
        return 0;
    }
}