Pagini recente » Cod sursa (job #136324) | Cod sursa (job #457814) | Cod sursa (job #1674489) | Cod sursa (job #457948) | Cod sursa (job #1569141)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("elmaj.in");
ofstream out("elmaj.out");
long long x,a[1000000];
int n,i,nr,sol,Max=0,m=0;
int main()
{
in>>n;
for(i=1;i<=n;i++)
in>>a[i];
nr=1; x=a[1];
for(i=2; i<=n; i++)
{
if (a[i] == x) nr++;
else
{
x=a[i]; nr=1;
}
if (nr >= Max)
{
Max = nr;
sol = x;
}
}
for(i=1;i<=n;i++)
if(a[i]==sol) m++;
if(nr<0)
{
out<<-1;
return 0;
}
if(m > n/2)
out<<sol<<' '<<m;
else out<<-1;
return 0;
}