Pagini recente » Cod sursa (job #1477865) | Cod sursa (job #1559741) | Istoria paginii runda/nu_ca-i_minunat/clasament | Cod sursa (job #411641) | Cod sursa (job #2431355)
#include <iostream>
#include <fstream>
#include <random>
#include <ctime>
#include <cstdlib>
#include <algorithm>
using namespace std;
ifstream fin("elmaj.in");
ofstream fout("elmaj.out");
int a[1000001];
int k,n;
int countTimes(int x)
{
int counter=0;
for(int i=0;i<n;i++)
if(x==a[i])
counter++;
return counter;
}
int main()
{
fin>>n;
k = n/2;
for(int i = 0;i<n;i++)
fin>>a[i];
nth_element(a,a+k,a+n);
int var = a[k];
int counter = countTimes(var);
if(counter>k)
fout<<var<<" "<<counter<<'\n';
else
fout<<-1<<'\n';
return 0;
}