Pagini recente » Cod sursa (job #800472) | Cod sursa (job #611513) | Cod sursa (job #805798) | Cod sursa (job #540936) | Cod sursa (job #820046)
Cod sursa(job #820046)
#include <fstream>
#include <algorithm>
using namespace std;
ifstream in("elmaj.in");
ofstream out("elmaj.out");
const int MAX=1000100;
int v[MAX],n;
int main(){
in>>n;
int i;
for(i=1;i<=n;++i){
in>>v[i];
}
nth_element(v+1,v+n/2,v+n+1);
int maj=n/2;
int ap=0;
for(i=1;i<=n;++i){
if(maj==v[i]){
ap++;
}
}
if(2*ap>=n){
out<<maj<<" "<<ap;
return 0;
}
out<<"-1";
return 0;
}