Cod sursa(job #1551704)
| Utilizator | Data | 16 decembrie 2015 13:31:00 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.56 kb |
#include<fstream>
#include<algorithm>
using namespace std;
int N,v[1000001],i;
ifstream in("elmaj.in");
ofstream out("elmaj.out");
int main()
{
in>>N;
for(i=1;i<=N;++i)
{
in>>v[i];
}
sort(v+1,v+N+1);
int nr=1;
for(i=2;i<=N;++i)
{
if(v[i]==v[i-1])
++nr;
else
{
if(nr >= N/2+1)
{
out<<v[i-1]<<" "<<nr;
return 0;
}
nr=1;
}
}
if(nr==1)
out<<v[1]<<" "<<1;
return 0;
}
