Pagini recente » Borderou de evaluare (job #1143877) | Borderou de evaluare (job #248436) | Rezultatele filtrării | Borderou de evaluare (job #3196460) | Cod sursa (job #2267816)
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("elmaj.in");
ofstream fout("elmaj.out");
long long v[1000002];
int main()
{
int n;
fin>>n;
for(int i=0;i<n;i++)
fin>>v[i];
sort(v,v+n);
auto it=equal_range(v,v+n,v[n/2]);
int l=it.second-it.first;
if( (n%2)?l>n/2:l>=n/2)
fout<<v[n/2]<<" "<<l;
else fout<<-1;
return 0;
}