Cod sursa(job #1878589)
| Utilizator | Data | 14 februarie 2017 11:55:06 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 90 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.55 kb |
#include <iostream>
#include <fstream>
#include <map>
using namespace std;
int N,x,maxim,i,imax;
int main()
{
ifstream fin("elmaj.in");
ofstream fout("elmaj.out");
map <int , int>mp;
fin>>N;
for(i=1;i<=N;i++)
{
fin>>x;
mp[x]++;
if(mp[x]>maxim)
{
maxim= mp[x];
imax=x;
}
}
if(maxim >= N/2+1)
{
fout<<imax<<" "<<maxim;
return 0;
}
else
fout<<"-1";
fin.close();
fout.close();
return 0;
}
