Pagini recente » Cod sursa (job #2509894) | Cod sursa (job #2374273) | Cod sursa (job #2264803) | Cod sursa (job #1670892) | Cod sursa (job #1971795)
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream in("elmaj.in");
ofstream out("elmaj.out");
int n, v[1000005];
int main(){
in>>n;
for(int i=1; i<=n; i++)in>>v[i];
sort(v+1, v+n+1);
int el=v[n/2+n%2], a=0;
for(int i=n/2+1; i<=n&&v[i]==el; i++,a++);
for(int i=n/2; i>=1&&v[i]==el; i--,a++);
if(a<n/2+1)out<<-1;
else out<<el<<" "<<a;
return 0;
}