Cod sursa(job #720942)
Utilizator | Data | 23 martie 2012 07:09:54 | |
---|---|---|---|
Problema | Elementul majoritar | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include<fstream>
using namespace std;
#include<algorithm>
int n,v[1000001],i,j,nr=0;
int main()
{
ifstream fcin("elmaj.in");
ofstream fcout("elmaj.out");
fcin>>n;
for(i=1;i<=n;i++)
fcin>>v[i];
v[0]=0;
sort(v+1,v+n+1);
for(i=n/2+1;i>=1 && v[n/2+1]==v[i];i--)
nr++;
for(i=n/2+1;i<=n && v[n/2+1]==v[i];i++)
nr++;
if(nr>=n/2+1)
fcout<<v[n/2+1]<<" "<<nr-1;
else
fcout<<-1;
return 0;
}