Pagini recente » Cod sursa (job #257582) | Cod sursa (job #1497625) | Cod sursa (job #397882) | Cod sursa (job #165638) | Cod sursa (job #2520114)
#include <bits/stdc++.h>
using namespace std;
ifstream in("elmaj.in");
ofstream out("elmaj.out");
int n;
int candidat;
int apar;
int val[1000001];
int main()
{
in>>n;
for(int k=1;k<=n;k++)
{
in>>val[k];
if(apar==0)
{
apar++;
candidat=val[k];
}
else if(candidat!=val[k])
apar--;
else
apar++;
}
int aparC=0;
for(int i=1;i<=n;i++)
if(candidat==val[i])
aparC++;
if(aparC>=n/2+1)
out<<candidat<<' '<<aparC;
else
out<<-1;
return 0;
}