Pagini recente » Cod sursa (job #2588060) | Cod sursa (job #2623426) | Cod sursa (job #2762030) | Cod sursa (job #2427604) | Cod sursa (job #2371538)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("elmaj.in");
ofstream fout("elmaj.out");
int v[1000010],n,i,nrap,contor,candidat;
int main()
{
fin>>n;
for(i=1; i<=n; i++)
fin>>v[i];
candidat=v[1];
contor=1;
for(i=2; i<=n; i++)
{
if(v[i]==candidat)
contor++;
else
contor--;
if(contor==-1)
{
contor=1;
candidat=v[i];
}
}
nrap=0;
for(i=1; i<=n; i++)
{
if(v[i]==candidat)
nrap++;
}
if(nrap>=n/2+1)
{
fout<<candidat<<" "<<nrap;
}
else
fout<<-1;
fin.close();
fout.close();
return 0;
}