Cod sursa(job #1946243)
| Utilizator | Data | 29 martie 2017 23:39:33 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.57 kb |
#include <iostream>
#include <fstream>
#include <unordered_map>
using namespace std;
const int MAXN = 1000001;
int n, v[MAXN];
int main(int argc, const char * argv[]) {
ifstream cin("elmaj.in");
ofstream cout("elmaj.out");
unordered_map<int, int> elcnt;
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> v[i];
elcnt[v[i]]++;
}
for (int i = 0; i < n; i++) {
if (elcnt[v[i]] > n / 2) {
cout << v[i] << ' ' << elcnt[v[i]];
return 0;
}
}
cout << -1;
return 0;
}
