Cod sursa(job #820053)
Utilizator | Ion Vlad-Doru vlad.doru | Data | 19 noiembrie 2012 23:21:39 |
---|---|---|---|
Problema | Elementul majoritar | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <fstream>
#include <tr1/unordered_map>
using namespace std;
using namespace tr1;
ifstream in("elmaj.in");
ofstream out("elmaj.out");
unordered_map<int,int> H;
int n;
int main(){
in>>n;
int i,x;
int maj=0;
for(i=1;i<=n;++i){
in>>x;
H[x]++;
if(2*H[x]>=n){
maj=x;
}
}
if(maj){
out<<maj<<" "<<H[maj];
return 0;
}
out<<"-1";
return 0;
}