Cod sursa(job #2253258)
Utilizator | Data | 3 octombrie 2018 20:16:42 | |
---|---|---|---|
Problema | Elementul majoritar | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.51 kb |
#include <iostream>
#include <fstream>
using namespace std;
int v[100001];
int main()
{
ifstream cin("elmaj.in");
ofstream cout("elmaj.out");
int n,nr;
cin>>n;
for(int i=1;i<=n;i++)
{
cin>>nr;
v[nr]++;
}
int max=0,val,e=n/2+1;
for(int i=1;i<=n;i++)
{
if(v[i]>=e && v[i]>max )
{
max=v[i];
val=i;
}
}
if(max>0) cout<<val<<" "<<max;
else cout<<"-1";
return 0;
}