Pagini recente » Cod sursa (job #2228285) | Cod sursa (job #1512484) | Cod sursa (job #1330122) | Cod sursa (job #1920786) | Cod sursa (job #2050391)
#include <cstdio>
using namespace std;
int n;
int a[1000001];
int main()
{
freopen("elmaj.in", "r", stdin);
freopen("elmaj.out", "w", stdout);
scanf("%d", &n);
int nr=0, c, fr=0;
scanf("%d", &a[0]);
nr = 1;
c = a[0];
for(int i=1; i<n; i++)
{
scanf("%d", &a[i]);
if(a[i-1] == a[i])
nr++;
else{
if(nr == 0)
c = a[i];
nr--;
}
}
for(int i=0; i<=n; i++)
if(a[i] == c)
fr++;
if(fr >= n/2+1)
printf("%d %d", c, fr);
else printf("-1");
return 0;
}