Pagini recente » Cod sursa (job #1408956) | Cod sursa (job #2071022) | Cod sursa (job #1642513) | Cod sursa (job #1933763) | Cod sursa (job #1611604)
#include<iostream>
#include<fstream>
#include<algorithm>
using namespace std;
ifstream fin("elmaj.in");
ofstream fout("elmaj.out");
int n,v[1000],nrst,st,i;
int main()
{
fin>>n;
fin>>v[1];
st=1;
nrst=v[1];
for(i=2;i<=n;i++)
{
fin>>v[i];
if(st==0&&v[i]!=nrst)
{
nrst=v[i-1];
st=1;
}
if(nrst==v[i])
st++;
else
st--;
}
int nr=0;
for(i=1;i<=n;i++)
{
if(v[i]==nrst)
nr++;
}
if(st>0&&nr>n/2)
fout<<nrst<<" "<<nr;
else
{
if(nr>n/2)
fout<<nrst<<" "<<nr;
else
fout<<-1<<" ";
}
fin.close();
fout.close();
return 0;
}