Cod sursa(job #1810267)
| Utilizator | Data | 19 noiembrie 2016 20:21:18 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.47 kb |
#include <bits/stdc++.h>
#define prim 123457
using namespace std;
ifstream fin("elmaj.in");
ofstream fout("elmaj.out");
int a[1000005],n;
int main()
{
int i,sol=0,maj;
fin>>n;
for(i=1;i<=n;i++)
fin>>a[i];
nth_element(a+1,a+n/2+1,a+n+1);
maj=a[n/2+1];
for(i=1;i<=n;i++)
if(maj==a[i])sol++;
if(sol>n/2)
fout<<maj<<" "<<sol<<"\n";
else fout<<"-1\n";
fin.close();
fout.close();
return 0;
}
