Pagini recente » Cod sursa (job #2445557) | Cod sursa (job #2071554) | Cod sursa (job #956747) | Cod sursa (job #143923) | Cod sursa (job #979528)
Cod sursa(job #979528)
#include<stdio.h>
#define maxn 1000005
using namespace std;
int n,nr;
int a[maxn];
void solve()
{
int npair=0,last;
scanf("%d",&n);
for(int i=1;i<=n;i++)
{
scanf("%d",&a[i]);
if(npair==0) last=a[i],npair++;
else
if(last==a[i]) npair++;
else npair--;
}
for(int i=1;i<=n;i++)
if(a[i]==last) nr++;
if(nr>n/2) printf("%d %d",last,nr);
else printf("-1");
}
int main()
{
freopen("elmaj.in","r",stdin);
freopen("elmaj.out","w",stdout);
solve();
fclose(stdin);
fclose(stdout);
return 0;
}