Cod sursa(job #2377196)
Utilizator | Covei Denis cdenis | Data | 8 martie 2019 23:11:54 |
---|---|---|---|
Problema | Elementul majoritar | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.59 kb |
#include <fstream>
#include <algorithm>
using namespace std;
#define MAX 1000005
ifstream fin("elmaj.in");
ofstream fout("elmaj.out");
int n,i,k,kmax,v[MAX],var;
int main()
{
fin >> n;
for(i=1; i<=n; i++)
fin >> v[i];
sort(v+1,v+n+1);
for(i=1; i<=n ;i++)
{
k++;
if(v[i]!=v[i+1])
{
if(k>kmax)
kmax=k, var=v[i];
k=0;
}
}
if(k>kmax)
kmax=k, var=v[n];
if(kmax>n/2)
fout << var << " " << kmax;
else
fout << -1;
return 0;
}