Cod sursa(job #925598)
| Utilizator | Data | 24 martie 2013 17:07:08 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 90 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.46 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 i,N,nr;
fin>>N;
for (i=1;i<=N;i++)
fin>>v[i];
sort(v+1,v+N+1);
fout<<v[N/2+1]<<" ";
i=0;
while (v[N/2+2+i]==v[N/2+1]) i++;
nr=i+1;
i=0;
while (v[N/2-i]==v[N/2+1]) i++;
nr+=i;
fout<<nr;
return 0;
}
