Pagini recente » Cod sursa (job #3131754) | Cod sursa (job #2722654) | Cod sursa (job #1607660) | Cod sursa (job #959048) | Cod sursa (job #1053902)
#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
using namespace std;
ifstream in("elmaj.in");
ofstream out("elmaj.out");
size_t n;
vector<unsigned> v;
int main() {
in >> n;
v.resize(n);
for(auto &i:v)
in >> i;
sort(v.begin(), v.end());
for(size_t i = 0; i <= n/2; ++i) {
size_t j = i;
for(;j < n&&v[i]==v[j]; ++j);
if(j-i>=n/2){
out << v[i] << ' ' <<j-i << '\n';
return 0;
}
}
out << -1 << '\n';
return 0;
}