Pagini recente » Clasamentul arhivei de probleme | Cod sursa (job #3206662) | Cod sursa (job #535793) | Istoria paginii runda/oji_go_11_12_2 | Cod sursa (job #2312309)
#include <bits/stdc++.h>
#define N 1000010
using namespace std;
ifstream fin ("elmaj.in");
ofstream fout ("elmaj.out");
int a[N],n;
int main ()
{
int i, cand, vot;
fin>>n;
for (i=1;i<=n;++i) fin>>a[i];
fin.close();
/// cautam posibilul candidat care ar putea castiga
cand=a[1]; vot=1;
for (i=2;i<=n;++i)
if (a[i]==cand) vot++;
else if (vot==0) cand=a[i],vot=1;
else vot--;
/// verificam daca are voturile necesare
vot=0;
for (i=1;i<=n;++i)
if (cand==a[i]) vot++;
if (vot>n/2) fout<<cand<<' '<<vot;
else fout<<-1;
fout<<'\n';
fout.close();
return 0;
}