Cod sursa(job #2340238)
Utilizator | Data | 10 februarie 2019 09:52:27 | |
---|---|---|---|
Problema | Elementul majoritar | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.52 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("elmaj.in");
ofstream fout("elmaj.out");
int n,v[1000002],i,nr;
int main()
{
fin>>n;
for(i=1;i<=n;i++)
fin>>v[i];
sort(v+1,v+n+1);
bool ok=0;
for(i=1;i<=n+1&&!ok;i++)
{
if(v[i]==v[i-1])
nr++;
else
{
if(nr>n/2)
{
ok=1;
fout<<v[i-1]<<" "<<nr;
}
nr=1;
}
}
if(!ok)
fout<<-1;
return 0;
}