Pagini recente » Cod sursa (job #615286) | Cod sursa (job #2737937) | Cod sursa (job #2945924) | Cod sursa (job #625706) | Cod sursa (job #2252111)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fi("elmaj.in");
ofstream fo("elmaj.out");
int contender[1000000];
int main()
{
int n, apar = 0, title;
fi>>n;
for(int i = 1; i <= n; ++i)
{
fi>>contender[i];
if(apar == 0)
{
title = contender[i];
apar = 1;
continue;
}
if(contender[i] == title)
apar++;
if(contender[i] != title)
apar--;
}
if(apar == 0)
{
fo<<-1;
return 1;
}
int countt = 0;
for(int i = 1; i <= n; ++i)
{
if(contender[i] == title)
countt++;
}
if(countt > n/2)
fo<<title<<" "<<countt;
else
fo<<-1;
}