Cod sursa(job #1917268)
Utilizator | Data | 9 martie 2017 11:50:45 | |
---|---|---|---|
Problema | Elementul majoritar | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("elmaj.in");
ofstream out("elmaj.out");
int x,cur,ap,n,a[1000005];
int main()
{
in>>n;
for(int i=1;i<=n;++i)
{
in>>a[i];
if(a[i]!=cur)--ap;
if(ap<0)
{
ap=1;
cur=a[i];
}
}
for(int i=1;i<=n;++i)
{
if(a[i]==cur)++ap;
}
if(ap>=n/2+1)out<<cur<<" "<<ap;
else out<<"-1";
return 0;
}