Pagini recente » Cod sursa (job #1147720) | Cod sursa (job #59181) | Cod sursa (job #83108) | Cod sursa (job #1213143) | Cod sursa (job #1678563)
#include <iostream>
#include <fstream>
#include <algorithm>
#define lim 1000001
using namespace std;
ifstream fin("elmaj.in");
ofstream fout("elmaj.out");
int n,v[lim],mijl,st,dr,i;
int main()
{
fin>>n;
for(i=1; i<=n; i++)
fin>>v[i];
sort(v+1,v+n+1);
mijl=n/2;
st=mijl-1;
dr=mijl+1;
while(v[st]==v[mijl])
st--;
st++;
while(v[dr]==v[mijl])
dr++;
dr--;
if(dr-st+1 >= n/2+1)
fout<<v[mijl]<<' '<<dr-st+1;
fin.close();
fout.close();
return 0;
}