Cod sursa(job #2046234)
| Utilizator | Data | 23 octombrie 2017 16:44:17 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.47 kb |
#include <iostream>
#include <fstream>
#include<algorithm>
using namespace std;
ifstream fin("elmaj.in");
ofstream fout("elmaj.out");
int v[1000002],n,i,x,nr;
int main()
{
fin>>n;
for(i=1;i<=n;i++)
{
fin>>v[i];
}
sort(v+1,v+n+1);
x=v[n/2];
nr=0;
for(i=1;i<=n;i++)
{
if(x==v[i]) nr++;
}
if(nr>=n/2+1) fout<<x<<" "<<nr;
else fout<<"-1";
fin.close();
fout.close();
return 0;
}
