Pagini recente » Cod sursa (job #1815698) | Cod sursa (job #1282799) | Cod sursa (job #838337) | Cod sursa (job #1657241) | Cod sursa (job #1666070)
#include <iostream>
#include <fstream>
using namespace std;
ofstream fout ("elmaj.out");
ifstream fin ("elmaj.in");
int n,v[1000005],candidat,contor;
int main()
{
fin>>n;
for(int i=1;i<=n;i++) fin>>v[i];
candidat=v[1];
contor=1;
for(int i=2;i<=n;i++)
{
if(candidat==v[i]) contor++;
else contor--;
if(contor==0) {candidat=v[i];contor=1;}
}
contor=0;
for(int i=1;i<=n;i++) if(v[i]==candidat) contor++;
if(contor>n/2) fout<<candidat<<" "<<contor;
else fout<<-1;
}