Pagini recente » Cod sursa (job #504893) | Istoria paginii runda/geometrie01 | Cod sursa (job #758086) | Cod sursa (job #2485737) | Cod sursa (job #1852469)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("elmaj.in");
ofstream fout("elmaj.out");
int a[1000002],maj[1000002];
int main()
{
int n,i,maj,vot,ct;
fin>>n;
for(i=1;i<=n;i++)
fin>>a[i];
fin.close();
maj=a[1]; vot=1;
for(i=2;i<=n;i++)
if(a[i]==maj) vot++;
else if (vot>0) vot--;
else {maj=a[i]; vot=1;}
ct=0;
for(i=1;i<=n;i++)
if(a[i]==maj) ct++;
if(ct>=n/2+1) fout<<maj<<" "<<ct;
else fout<<-1;
fout.close();
return 0;
}