Cod sursa(job #1914809)
Utilizator | Data | 8 martie 2017 18:38:10 | |
---|---|---|---|
Problema | Elementul majoritar | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("elmaj.in");
ofstream g("elmaj.out");
int i,p,n,j,x[1000001],ok,k[2000001],Max;
int main ()
{
f>>n;
Max=0;
for(i=1;i<=n;i++)
{
f>>x[i];
k[x[i]]++;
if(Max<x[i]) Max=x[i];
}
for(i=1;i<=n/2;i++)
{
if(k[i]>(n/2+1))
{
g<<x[i]<<" "<<k[i];
ok=1;
break;
}
}
if(ok==0) g<<-1;
return 0;
}