Pagini recente » Cod sursa (job #2601335) | Cod sursa (job #2684407) | Cod sursa (job #1223116) | Cod sursa (job #1515173) | Cod sursa (job #1495831)
#include <cstdio>
using namespace std;
int n;
long long v[1000001];
int main()
{
freopen("elmaj.in","r",stdin);
freopen("elmaj.out","w",stdout);
scanf("%d",&n);
int nr = 0;
long long elem = -1;
for(int i = 1; i<=n; i++)
{
scanf("%lld",&v[i]);
if(nr == 0)
{
elem = v[i];
nr=1;
}
else if(elem == v[i])
nr--;
else
nr++;
}
int verificare = 0;
for(int i =1 ;i<=n;i++)
if(v[i] == elem)
verificare++;
if(verificare>=n/2+1)
printf("%lld %d",elem,verificare);
else
printf("-1");
return 0;
}