Cod sursa(job #1936313)
| Utilizator | Data | 22 martie 2017 23:41:51 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.55 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin ("elmaj.in");
ofstream fout ("elmaj.out");
int n,v[1000002],nr;
int main()
{
fin>>n;
for(int i=1;i<=n;++i)
fin>>v[i];
int p=v[1],no=1;
for(int i=2;i<=n;++i){
if(!no){
no++;
p=v[i];
}
else if(p==v[i]){
no++;
}
else
no--;
}
for(int i=1;i<=n;++i)
if(v[i]==p)nr++;
if(n/2+1<=nr)fout<<p<<' '<<nr<<endl;
else fout<<-1<<endl;
return 0;
}
