Cod sursa(job #1120796)
Utilizator | Data | 25 februarie 2014 10:12:39 | |
---|---|---|---|
Problema | Elementul majoritar | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include <fstream>
using namespace std;
ifstream fin("elmaj.in");
ofstream fout("elmaj.out");
long long a[100000001],i,p,e,n,h;
int main()
{
fin>>n;
fin>>a[1];
e=a[1]; p=1;
for(i=2;i<=n;i++)
{
fin>>a[i];
if(a[i]==e) p++;
else
{
p--;
if(p==0) p=1,e=a[i];
}
}
for(i=1;i<=n;i++)
if(a[i]==e) h++;
if(h>=n/2+1) fout<<e<<' '<<h;
else fout<<-1;
return 0;
}