CF 1144B 贪心

B. Parity Alternated Deletions
Polycarp has an array a consisting of n 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−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 n (1≤n≤2000) — the number of elements of a.
The second line of the input contains n integers a1,a2,…,an (0≤ai≤106), where ai is the i-th element of a.
Output
Print one integer — the minimum possible sum of non-deleted elements of the array after end of the game.
Examples
input
5
1 5 7 8 2
output
0
input
6
5 1 2 4 6 3
output
0
input
2
1000000 1000000
output
1000000
代码：

#include<bits/stdc++.h>
using namespace std;
inline int read(){
	int x=0,f=0;char ch=getchar();
	while(ch<'0'||ch>'9')f|=ch=='-',ch=getchar();
	while(ch>='0'&&ch<='9')x=x*10+(ch^48),ch=getchar();
	return f?-x:x;
}
int a[2019];
priority_queue<int>b,c;
int main(){
	int n=read();
	for(int i=0;i<n;++i){
		a[i]=read();
		if(a[i]&1)b.push(a[i]);
		else c.push(a[i]);
	}
	long long ans=0;
	while(!b.empty()&&!c.empty())b.pop(),c.pop();
	if(b.size()==c.size()){
		puts("0");
		exit(0);
	}
	if(b.empty()){
		c.pop();
		while(!c.empty())ans+=c.top(),c.pop();
	}else{
		b.pop();
		while(!b.empty())ans+=b.top(),b.pop();
	}
	printf("%I64d\n",ans);
    	return 0;
}