CSU-暑假集训题 B - Parity Alternated Deletions CodeForces - 1144B

#include<iostream>
#include<algorithm>
using namespace std;
const int MAX=1e6+10;
long long a[MAX],b[MAX];
int main()
{
    int n;
    cin>>n;
    long long num,count1=0,count2=0;
    long long sum=0;
    for(int i=0;i<n;i++)
    {
        cin>>num;
        if(num%2==1)a[++count1]=num;
        else b[++count2]=num;
    }
    if(count1==count2)
    {
        cout<<0<<endl;
        return 0;
    }else if(count1>count2)
    {
        sort(a+1,a+count1+1);
        for(int i=1;i<count1-count2;i++)sum+=a[i];
    }else{
        sort(b+1,b+count2+1);
        for(int i=1;i<count2-count1;i++)sum+=b[i];
    }
    cout<<sum<<endl;
    return 0;
}