Pagini recente » Cod sursa (job #47154) | Cod sursa (job #1971122) | Cod sursa (job #2965498) | Cod sursa (job #3210585) | Cod sursa (job #2559172)
#include <iostream>
#include <fstream>
using namespace std;
int x[1000002];
int main()
{
ifstream fin("elmaj.in");
ofstream fout("elmaj.out");
int n,candidat=0,nr=1;
fin>>n;
for(int i=1;i<=n;i++){
fin>>x[i];
if(x[i]==candidat){
nr++;
}else{
if(nr==1){
candidat=x[i];
}else{
nr--;
}
}
}
nr=0;
for(int i=1;i<=n;i++){
if(x[i]==candidat){
nr++;
}
}
if(nr>n/2){
fout<<candidat<<" "<<nr;
}else{
fout<<-1;
}
return 0;
}