Pagini recente » Cod sursa (job #1066189) | Cod sursa (job #2957895) | Cod sursa (job #1401202) | Cod sursa (job #3211565) | Cod sursa (job #1167655)
#include <fstream>
#include <iostream>
#define N 1000001
int a[N];
int main()
{
int n;
std::ifstream fin("elmaj.in");
std::ofstream fout("elmaj.out");
fin>>n;
for(int i=0;i<n;i++)
{
fin>>a[i];
}
int current = -1;
int count = 0;
for(int i=0;i<n;i++)
{
if(count==0)
{
current = a[i];
count++;
}
else
{
if(current!=a[i])
count--;
else
count++;
}
}
if(count==0)
{
fout<<-1;
return 0;
}
count=0;
for(int i=0;i<n;i++)
{
if(a[i]==current)
count++;
}
if(count>=n/2+1)
fout<<current<<" "<<count;
else
fout<<current;
return 0;
}