Pagini recente » Cod sursa (job #1776643) | Cod sursa (job #2320564) | Cod sursa (job #2783003) | Cod sursa (job #3192574) | Cod sursa (job #1293302)
#include <fstream>
using namespace std;
ifstream fin("elmaj.in");
ofstream fout("elmaj.out");
int n, m, i, j, k, ok, v[1000001];
int w[1000001], varf;
int main(){
fin >> n;
varf = 0;
for(i = 1; i <= n; i ++){
fin >> v[i];
if(varf == 0){
w[++varf] = v[i];
}
else
if(v[i] == w[varf]){
w[++varf] = v[i];
}
else{
w[varf--] = 0;
}
}
varf = 0;
for(i = 1; i <= n; i ++){
if(v[i] == w[1])
varf ++;
}
if(varf > n / 2)
fout << w[1] << " " << varf;
else
fout << -1;
return 0;
}