Cod sursa(job #2088432)
| Utilizator | Data | 15 decembrie 2017 10:31:17 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.48 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("elmaj.in");
ofstream g("elmaj.out");
int v[1000001];
int main()
{
int n,i,mx=0,nrap,cv;
f>>n;
for(i=1;i<=n;i++)
f>>v[i];
sort(v+1,v+i+1);
nrap=1;
v[n+1]=-1;
for(i=2;i<=n+1;i++)
{
if(v[i]==v[i-1])
nrap++;
else
{
if(nrap>mx)
mx=nrap,cv=v[i-1];
nrap=1;
}
}
if(mx>n/2)
g<<cv<<" "<<mx;
else g<<-1;
return 0;
}
