Pagini recente » Cod sursa (job #2863461) | Cod sursa (job #5413) | Clasamentul arhivei de probleme | Cod sursa (job #2092659) | Cod sursa (job #2460452)
#include <bits/stdc++.h>
using namespace std;
ifstream f("elmaj.in");
ofstream g("elmaj.out");
int n,v[1000005];
int main()
{
f>>n;
for(int i=1;i<=n;i++)
f>>v[i];
int ap=0,cand=0,cont=0;
for(int i=1;i<=n;i++)
{
if(cont==0)
{
cand=v[i];
cont=1;
}
else
if(v[i]==cand)cont++;
else cont--;
}
for(int i=1;i<=n;i++)
if(v[i]==cand)ap++;
if(ap<n/2-1)
g<<-1;
else g<<cand<<' '<<ap;
g.close();
return 0;
}