Cod sursa(job #1051968)
Utilizator | Catalina Elena Radu CatalinaRadu | Data | 10 decembrie 2013 19:25:37 |
---|---|---|---|
Problema | Elementul majoritar | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include <fstream>
#include <unordered_map>
using namespace std;
ifstream f ("elmaj.in");
ofstream g ("elmaj.out");
unordered_map<int,int> Hash;
int main()
{
int n,i,maxim,lim,x;
maxim=0;
lim=n/2+1;
f>>n;
for (i=1;i<=n;i++)
{
f>>x;
++Hash[x];
if(Hash[x]>maxim)
maxim=x;
}
if(maxim<lim)
g<<-1;
else
g<<maxim<<' '<<Hash[maxim];
f.close();
g.close();
return 0;
}