Cod sursa(job #2260120)
| Utilizator | Data | 14 octombrie 2018 14:29:08 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.66 kb |
#include <fstream>
#include <algorithm>
using namespace std;
int v[1000001];
int main()
{
int n,i,nr;
ifstream fin("elmaj.in");
ofstream fout("elmaj.out");
fin>>n;
for (i=1;i<=n;i++)
fin>>v[i];
sort(v+1,v+n+1);
nr=1;
int a;
for (i=2;i<=n;i++)
{
if (v[i]==v[i-1])
{
nr++;
a=v[i];
}
else
{
if (nr>=n/2+1)
{
fout<<a<<" "<<nr;
n=-1;
}
else
{
nr=1;
}
}
}
if (n!=-1)
fout<<-1;
return 0;
}
