Pagini recente » Cod sursa (job #3125161) | Cod sursa (job #306399) | Cod sursa (job #110556) | Cod sursa (job #413114) | Cod sursa (job #2418102)
#include <fstream>
#include <vector>
#include <algorithm>
using namespace std;
ifstream in("elmaj.in");
ofstream out("elmaj.out");
int main()
{
ios_base::sync_with_stdio(0);
in.tie(0);
out.tie(0);
int n;
in >> n;
vector<int> v(n+1);
for(int i = 0; i < n; i++) in >> v[i];
sort(v.begin(),v.end());
int el = v[n/2-1];
int fr = 0;
for(int i = 0; i < n; i++)
if(v[i] == el) fr++;
if(fr >= n/2 + 1) out << el << ' ' << fr;
else out << -1;
return 0;
}