Cod sursa(job #1380406)
Utilizator | Data | 7 martie 2015 18:42:16 | |
---|---|---|---|
Problema | Elementul majoritar | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Teme Pregatire ACM Unibuc 2013 | Marime | 0.44 kb |
#include<fstream>
#include<unordered_map>
using namespace std;
typedef int var;
ifstream fin("elmaj.in");
ofstream fout("elmaj.out");
unordered_map<var, var> H;
var sol;
int main() {
var n, v;
fin>>n;
for(var i=1; i<=n; i++) {
fin>>v;
H[v] ++;
if(H[v] >= n/2+1) {
sol = v;
}
}
if(sol)
fout<<sol<<" "<<H[sol];
else fout<<"-1";
return 0;
}