Submission #1082212

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define maxn 100010
int a[maxn];
map <int, int> M;
set <int> s;
vector <int> v;
int main(){
	int n;
	cin>>n;
	for (int i=1; i<=n; i++) {
		cin>>a[i];
		M[a[i]]++;
		s.insert(a[i]);
	}
	int ans= 0;
	for (set <int> :: iterator it= s.begin(); it!=s.end(); it++){
		int cur= *it;
		if (M[cur]%2==0) v.push_back(cur);
		else ans++;
	}
	if (v.size()%2==1) v.pop_back();
	cout<<ans+v.size()<<endl;

}

Submission Info

Judge Result