Cod sursa(job #2763797)
| Utilizator | Data | 16 iulie 2021 19:20:19 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.58 kb |
#include <fstream>
#include <unordered_map>
using namespace std;
ifstream fin("elmaj.in");
ofstream fout("elmaj.out");
unordered_map<int, int> m;
int n, x;
int main() {
fin >> n;
for(int i = 1; i <= n; i++) {
fin >> x;
m[x]++;
}
fin.close();
int majoritar = -1;
unordered_map<int, int>::iterator itr;
for(itr = m.begin(); itr != m.end(); itr++) {
if(itr -> second > n / 2) {
majoritar = itr -> first;
break;
}
}
fout << majoritar;
fout.close();
return 0;
}