Pagini recente » Cod sursa (job #1427876) | Cod sursa (job #2815794) | Cod sursa (job #2322242) | Cod sursa (job #2133425) | Cod sursa (job #2378409)
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
//FILE *f,*g;
ifstream f("elmaj.in");
ofstream g("elmaj.out");
int v[1000002];
int n,x,nr;
void read()
{
f>>n;
for(int i=1; i<=n; i++)
f>>v[i];
}
void solve()
{
sort(v+1,v+n+1);
x=v[n/2];
for(int i=n/2; x==v[i]; i++,nr++){}
for(int i=n/2-1; x==v[i];i--,nr++){}
}
void write()
{
if(nr>=n/2+1)
g<<x<<" "<<nr;
else
g<<"-1";
}
int main()
{
/*f=fopen("elmaj.in","r");
g=fopen("elmaj.out","w");*/
read();
solve();
write();
/*fclose(f);
fclose(g);*/
return 0;
}