Cod sursa(job #1061468)
| Utilizator | Data | 19 decembrie 2013 20:28:22 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 40 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.54 kb |
#include <iostream>
#include <fstream>
#include <unordered_map>
using namespace std;
unordered_map<int,int> unmap;
long long maxim,x,n,i,nrmax;
int main()
{
ifstream f("elmaj.in");
ofstream g("elmaj.out");
f>>n;
for(i=0;i<n;i++){
f>>x;
unmap[x]++;
if(unmap[x]>=(n/2+1)){
//maxim=unmap[x];
//nrmax=x;
g<<x<<" "<<unmap[x];
return 0;
}
}
/*if(maxim>0)
g<<nrmax<<" "<<maxim;
else*/
g<<-1;
return 0;
}
