Codeforces1144B(B题）Parity Alternated Deletions

B. Parity Alternated Deletions

Polycarp has an array aa consisting of nn integers.

He wants to play a game with this array. The game consists of several moves. On the first move he chooses any element and deletes it (after the first move the array contains n−1n−1 elements). For each of the next moves he chooses any element with the only restriction: its parity should differ from the parity of the element deleted on the previous move. In other words, he alternates parities (even-odd-even-odd-... or odd-even-odd-even-...) of the removed elements. Polycarp stops if he can't make a move.

Formally:

• If it is the first move, he chooses any element and deletes it;
• If it is the second or any next move:
  • if the last deleted element was odd, Polycarp chooses any even element and deletes it;
  • if the last deleted element was even, Polycarp chooses any odd element and deletes it.
• If after some move Polycarp cannot make a move, the game ends.

Polycarp's goal is to minimize the sum of non-deleted elements of the array after end of the game. If Polycarp can delete the whole array, then the sum of non-deleted elements is zero.

Help Polycarp find this value.

Input

The first line of the input contains one integer nn (1≤n≤20001≤n≤2000) — the number of elements of aa.

The second line of the input contains nn integers a1,a2,…,ana1,a2,…,an (0≤ai≤1060≤ai≤106), where aiai is the ii-th element of aa.

Output

Print one integer — the minimum possible sum of non-deleted elements of the array after end of the game.

代码：

#include<iostream>
#include<algorithm>
#include<cstring>
using namespace std;
int main() {
    int n,ji=0,ou=0,sum=0;
    cin>>n;
    int a[n+1],jisz[n],ousz[n];
    for(int i=0; i<n; i++) {
        cin>>a[i];
        if(a[i]%2==0) {
            ousz[ou++]=a[i];
        } else {
            jisz[ji++]=a[i];
        }
    }
    sort(ousz,ousz+ou);
    sort(jisz,jisz+ji);
    if(ji-ou<=1&&ji-ou>=-1) {
        cout<<0;
        return 0;
    } else {
        if(ou>ji+1) {
            for(int i=0; i<(ou-ji-1); i++) {
                sum+=ousz[i];
            }
        } else if(ji>ou+1) {
            for(int i=0; i<(ji-ou-1); i++) {
                sum+=jisz[i];
            }
        }
    }
    cout<<sum;
}

思路分析：如果奇偶数量差在1和-1之间输出0，因为肯定可以选完。否则根据偶数比奇数多的个数或奇数比偶数多的个数从排序后数组中输出相应个数。

题目链接：https://codeforces.com/contest/1144/problem/B