Pagini recente » Cod sursa (job #1752401) | Cod sursa (job #2519433) | Cod sursa (job #988359) | Cod sursa (job #2135323) | Cod sursa (job #1907097)
#include <bits/stdc++.h>
using namespace std;
#define mod 9973
int a[1000009];
int n,r,nr,cand;
int v[999999];
long long x,nrd;
void cit()
{
freopen("elmaj.in","r",stdin);
freopen("elmaj.out","w",stdout);
}
int main()
{
cit();
scanf("%d",&n);
for(int i=1;i<=n;i++)
{
scanf("%d",&a[i]);
if(r==0) {cand=a[i];r=1;}
else if(a[i]==cand)r++;
else r--;
}
if(cand<0){printf("-1"); return 0;}
for(int i=1;i<=n;i++)
if(a[i]==cand)nr++;
if(nr>n/2)printf("%d %d",cand,nr);
else printf("-1");
return 0;
}