Pagini recente » Cod sursa (job #2534760) | Cod sursa (job #2298689) | Cod sursa (job #2955142) | Cod sursa (job #523030) | Cod sursa (job #1811996)
#include <iostream>
#include <cstdio>
using namespace std;
int n,k,a[1000001];
void elmaj()
{
int cand = -1, k = 0;
for (int i = 0; i < n; i++)
{
if (k == 0)
{
cand = a[i];
k = 1;
}
else if (a[i] == cand)
{
k++;
}
else
k--;
}
if (cand < 0)
{
printf("-1");
return;
}
int nr = 0;
for (int i = 0; i < n; i++)
{
if (a[i] == cand)
{
nr++;
k=a[i];
}
}
if (nr > n / 2)
{
printf("%d %d",k,nr);
}
else
printf("-1");
}
int main()
{
freopen("elmaj.in","r",stdin);
freopen("elmaj.out","w",stdout);
scanf("%d",&n);
for(int i=0;i<n;i++)
scanf("%d",&a[i]);
elmaj();
return 0;
}