Cod sursa(job #1696861)
Utilizator | Data | 30 aprilie 2016 01:29:20 | |
---|---|---|---|
Problema | Elementul majoritar | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include <fstream>
using namespace std;
ifstream in("elmaj.in");
ofstream out("elmaj.out");
int n,Max=0,cnt[1000001]={},x,mpos;
int main()
{
in>>n;
for(int i=1;i<=n;i++)
{
in>>x;
cnt[x]++;
if(cnt[x]>Max)
{
Max=cnt[x];
mpos=x;
}
}
if(Max>=(n+1)/2)
out<<mpos<<' '<<Max;
else
out<<-1;
return 0;
}