Submission #3442720

---

Source Code Expand

#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <queue>
#include <deque>
#include <map>
using namespace std;



int main()
{
	int n;
	cin >> n;
	int v[10005];
	map<int, int> holdFirst, holdSecond;

	for (int i = 1; i <= n; i++) {
		cin >> v[i];
	}

	vector<int> a(10005), b(10005);
	fill(a.begin(), a.end(), 0);
	fill(b.begin(), b.end(), 0);

	for (int i = 1; i <= n; i++) {
		if (i % 2 == 1) {
			a[v[i]]++;
		}
		else {
			b[v[i]]++;
		}
	}

	int maxA = 0;
	int indexA = 0;
	int maxB = 0;
	int indexB = 0;

	for (int i = 1; i < 10005; i++) {
		if (a[i] > maxA) {
			maxA = a[i];
			indexA = i;
		}
		if (b[i] > maxB) {
			maxB = b[i];
			indexB = i;
		}
	}

	if (indexA != indexB) {
		cout << (n / 2 - maxA) + (n / 2 - maxB) << endl;
	}
	else {
		sort(a.begin(), a.end(), greater<int>());
		sort(b.begin(), b.end(), greater<int>());
		cout << min((n / 2 - a[0]) + (n / 2 - b[1]), (n / 2 - a[1]) + (n / 2 - a[0]));
	}
	
	return 0;
}

Submission Info

Judge Result