Cod sursa(job #925659)
| Utilizator | Data | 24 martie 2013 17:30:16 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.44 kb |
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
long long v[1000000];
int main()
{
ifstream fin("elmaj.in");
ofstream fout("elmaj.out");
int N,nr=0,i;
fin>>N;
for (i=1;i<=N;i++)
fin>>v[i];
nth_element(v+1,v+N/2+1,v+N+1);
for (i=1;i<=N;i++)
if (v[i]==v[N/2+1]) nr++;
if (nr>N/2) fout<<v[N/2+1]<<" "<<nr;
else fout<<"-1";
return 0;
}
