Pagini recente » Cod sursa (job #2638505) | Borderou de evaluare (job #589099) | Cod sursa (job #269793) | Cod sursa (job #550676) | Cod sursa (job #3284922)
#include<fstream>
#include<algorithm>
using namespace std;
ifstream cin("elmaj.in");
ofstream cout("elmaj.out");
const int NMax=1000003;
int n, v[NMax];
void read(){
cin>> n;
for(int i=0; i<n; i+=1)
cin>> v[i];
}
void solve(){
nth_element(v, v+n/2, v+n);
int cnt=0;
for(int i=0; i<n; i+=1)
if(v[i]==v[n/2])
cnt+=1;
if(cnt>n/2)
cout<< v[n/2]<< ' '<< cnt;
}
int main(){
read();
solve();
}