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