Pagini recente » Cod sursa (job #868865) | Cod sursa (job #3355037) | Cod sursa (job #781700) | Cod sursa (job #1636563) | Cod sursa (job #3312208)
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
ifstream fin("elmaj.in");
ofstream fout("elmaj.out");
using namespace std;
int v[1000001];
int main(){
int n;
fin>>n;
for(int i=1;i<=n;i++){
fin>>v[i];
}
sort(v+1,v+n+1);
int ct=0;
for(int i=1;i<=n;i++){
if(n%2==0){
if(v[i]==v[n/2]){
ct++;
}
}
else{
if(v[i]==v[n/2+1]){
ct++;
}
}
}
if(ct>=n/2){
if(n%2==0){
fout<<v[n/2]<<" "<<ct;
}
else{
fout<<v[n/2+1]<<" "<<ct;
}
}
else{
fout<<-1;
}
}