Pagini recente » Cod sursa (job #3364927) | Cod sursa (job #3364887) | Cod sursa (job #3364917) | Cod sursa (job #3364658) | Cod sursa (job #3366042)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("elmaj.in");
ofstream fout("elmaj.out");
int val[1000002];
int main(){
int n;
fin >> n;
int contor = 1;
fin >> val[1];
int rez = val[1];
for(int i = 2; i <= n; i++){
fin >> val[i];
if(val[i] != rez) contor--;
else contor++;
if(contor < 1) {
contor = 1;
rez = val[i];
}
}
contor = 0;
for(int i = 1; i <= n; i++){
if(val[i] == rez) contor++;
}
if(contor < (n/2 + 1)) fout << -1;
else fout << rez << " " << contor;
return 0;
}