Pagini recente » Borderou de evaluare (job #1537936) | Cod sursa (job #906478) | Cod sursa (job #945385) | Cod sursa (job #710374) | Cod sursa (job #2397865)
#include <iostream>
#include <fstream>
#include <unordered_map>
using namespace std;
ifstream fin("elmaj.in");
ofstream fout("elmaj.out");
#define For(i, a, b) for(i = (a); i <= (b); i++)
int n;
unordered_map<int, int> h;
unordered_map<int, int>::iterator it;
int main(){
int i, x, nr;
fin >> n;
For(i, 1, n){
fin >> x;
h[x]++;
}
nr = n / 2 + 1;
for(it = h.begin(); it != h.end(); it++)
if(it->second >= nr){
fout << it->first << ' ' << it->second;
break;
}
if(it == h.end()) fout << -1;
}