Pagini recente » Cod sursa (job #2426605) | Cod sursa (job #601277) | Cod sursa (job #2254621) | Cod sursa (job #2760623) | Cod sursa (job #2154215)
#include <iostream>
#include <fstream>
#include <algorithm>
#define MAXN 1000005
using namespace std;
ifstream in("elmaj.in");
ofstream out("elmaj.out");
int n,v[MAXN];
void cit(){
in>>n;
for(int i = 0 ; i < n; i++)
in>>v[i];
}
void rez(){
int k = 1,candidat = 0;
for(int i = 0; i < n; i ++){
if(v[i] == candidat)
k++;
else
k--;
if(k == 0){
candidat = v[i];
k = 1;
}
}
if(!candidat)
return;
int nrapp = 0;
for(int i = 0; i < n; i ++)
if(v[i] == candidat)
nrapp++;
if(nrapp >= n/2+1)
out<<candidat<<" "<<nrapp;
else
out<<-1;
}
int main()
{
cit();
rez();
return 0;
}