Pagini recente » Cod sursa (job #518427) | Cod sursa (job #251811) | Cod sursa (job #2226071) | Cod sursa (job #1985815) | Cod sursa (job #2312361)
#include <bits/stdc++.h>
#define N 100000
using namespace std;
ifstream fin ("elmaj.in");
ofstream fout("elmaj.out");
long long a[N],n;
int main()
{
int cand,vot,i,ct,j;
fin>>n;
for (i=1; i<=n; ++i)
fin>>a[i];
cand=a[1];vot=1;
for(i=2;i<=n;i++)
if(a[i]==cand) vot++;
else if(vot>0) vot--;
else {cand=a[i];vot=1;}
vot=0;
for (i=1;i<=n;++i)
if (a[i]==cand) vot++;
if (vot>n/2) fout <<cand<<" "<<vot;
else fout<<-1;
return 0;
}