Pagini recente » Cod sursa (job #1585459) | Cod sursa (job #2580863) | Cod sursa (job #1447339) | Cod sursa (job #1699131) | Cod sursa (job #1649457)
#include <bits/stdc++.h>
using namespace std;
FILE *fin = fopen("elmaj.in", "r");
FILE *fout = fopen("elmaj.out", "w");
const int NMax = 1e6 + 5;
int v[NMax];
int main(){
int n, best, ap;
fscanf(fin, "%d", &n);
best = -5; ap = 1;
for(int i = 1; i <= n; i++){
fscanf(fin, "%d", &v[i]);
if(v[i] == best){
ap++;
} else {
ap--;
if(ap == 0){
ap = 1;
best = v[i];
}
}
}
ap = 0;
for(int i = 1; i <= n; i++){
if(v[i] == best) ap++;
}
if(ap >= (n / 2) + 1){
fprintf(fout, "%d %d", best, ap);
} else {
fprintf(fout, "%d", -1);
}
return 0;
}