Pagini recente » Cod sursa (job #77576) | Profilu' lu' Razvan | Cod sursa (job #2085138) | Cod sursa (job #2358864) | Cod sursa (job #730192)
Cod sursa(job #730192)
//Include
#include <fstream>
#include <utility>
#include <algorithm>
using namespace std;
//Constante
const int MAX_SIZE = (int)1e6;
//Variabile
ifstream in("elmaj.in");
ofstream out("elmaj.out");
int n;
int v[MAX_SIZE];
int dif, value;
//Main
int main()
{
in >> n;
for(int i=0 ; i<n ; ++i)
in >> v[i];
sort(v, v+n);
value = v[n/2];
if((dif = upper_bound(v, v+n, value) - lower_bound(v, v+n, value)) >= n/2+1)
out << value << ' ' << dif << '\n';
else
out << "-1\n";
in.close();
out.close();
return 0;
}