Submission #3306029

---

Source Code Expand

#include <iostream>
#include <map>
#include <algorithm>
using namespace std;

int main(int argc, const char * argv[]) {
    int n; cin >> n;
    map<int, int> map1, map2;
    
    for (int i = 1; i <= n/2; i++) {
        int vOdd, vEven;
        cin >> vOdd >> vEven;
        if (map1.count(vOdd) == 0) {
            map1[vOdd] = 1;
        } else {
            map1[vOdd]++;
        }
        if (map2.count(vEven) == 0) {
            map2[vEven] = 1;
        } else {
            map2[vEven]++;
        }
    }
    
    int oddKey1, oddValue1 = 0, evenKey1, evenValue1 = 0;
    int oddKey2, oddValue2 = 0, evenKey2, evenValue2 = 0;
    for (auto it = map1.begin(); it != map1.end(); ++it) {
        if (oddValue1 <= it->second) {
            oddValue1 = it->second;
            oddKey1 = it->first;
        }
    }
    for (auto it = map1.begin(); it != map1.end(); ++it) {
        if (oddValue2 <= it->second && oddValue1 != it->second) {
            oddValue2 = it->second;
            oddKey2 = it->first;
        }
    }
    for (auto it = map2.begin(); it != map2.end(); ++it) {
        if (evenValue1 <= it->second) {
            evenValue1 = it->second;
            evenKey1 = it->first;
        }
    }
    for (auto it = map2.begin(); it != map2.end(); ++it) {
        if (evenValue2 <= it->second && evenValue1 != it->second) {
            evenValue2 = it->second;
            evenKey2 = it->first;
        }
    }
    
    if (oddKey1 != evenKey1) {
        cout << n - oddValue1 - evenValue1 << endl;
    } else if (oddValue1 + evenValue2 >= oddValue2 + evenValue1) {
        cout << n - (oddValue1 + evenValue2) << endl;
    } else {
        cout << n - (oddValue2 + evenValue1) << endl;
    }
    return 0;
}

Submission Info

Judge Result