Cod sursa(job #1051597)
Utilizator | Dan Ghita dan.ghita | Data | 10 decembrie 2013 12:19:49 |
---|---|---|---|
Problema | Elementul majoritar | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include <iostream>
#include <fstream>
#include <unordered_map>
using namespace std;
ifstream f("elmaj.in");
ofstream g("elmaj.out");
unordered_map<int, int> h;
unordered_map<int, int>::iterator it;
int n, a;
int main()
{
f>>n;
for(int i=0; i<n; ++i){
f>>a;
h[a]++;
}
for(it=h.begin(); it!=h.end(); ++it){
if(it->second>=n/2+1){
g<<it->first<<' '<<it->second<<'\n';
return 0;
}
}
g<<-1;
return 0;
}