Parity Alternated Deletions

B. Parity Alternated Deletions
time limit per test2 seconds
memory limit per test256 megabytes
inputstandard input
outputstandard output
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
inputCopy
5
1 5 7 8 2
outputCopy
0
inputCopy
6
5 1 2 4 6 3
outputCopy
0
inputCopy
2
1000000 1000000
outputCopy
1000000

题目思路：删元素，使得剩下的尽量小，

奇数偶数分两个数组

哪个多从哪个删，分存的时候记录下奇数多还是偶数多

少的那个肯定就删没了

#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<iostream>
#include<algorithm>
using namespace std;
int a[1000005];
int b[1000005];
int c[1000005];
int main(){
	int n;
	int v=0;
	int w=0;
	int count1=0;
	int count2=0;
	int sum=0;
	while(scanf("%d",&n)!=EOF){
		int i;
		for(i=0;i<n;i++){
			scanf("%d",&a[i]);
			if(a[i]%2==0){       //偶数存数组b
				b[w]=a[i];
				w++;
				count1++;
			}
			else{                       //奇数存数组a
				c[v]=a[i];
				v++;
				count2++;
			}
		}
		sort(b,b+count1);           //排序
		sort(c,c+count2);
		if(count2>count1){                         //看哪个多然后加到sum里
			for(i=0;i<count2-count1-1;i++){
				sum=sum+c[i];
			}
		}
		else if(count2<count1){
			for(i=0;i<count1-count2-1;i++){
				sum=sum+b[i];
			}
		}
		printf("%d\n",sum);
	}
	return 0;
}