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<iostream>
#include<algorithm>
using namespace std;
int N,sum=0;
int odd[2500];
int even[2500];
bool cmp(int a,int b){
return a>b;
}
int main(){
cin>>N;
int number;
int a=0,b=0;
for(int i=0;i<N;i++){
cin>>number;
sum+=number;
if(number%2==0){
even[a++]=number;
}else{
odd[b++]=number;
}
}
sort(even,even+a,cmp);
sort(odd,odd+b,cmp);
if(a>b){
for(int i=0;i<b;i++){
sum-=odd[i];
sum-=even[i];
}
sum-=even[b];
}else if(a<b){
for(int i=0;i<a;i++){
sum-=odd[i];
sum-=even[i];
}
sum-=odd[a];
}else{
sum=0;
}
cout<<sum<<endl;
return 0;
}