Pagini recente » Cod sursa (job #2726436) | Cod sursa (job #3128447) | Cod sursa (job #1396879) | Cod sursa (job #851689) | Cod sursa (job #1991915)
#include <fstream>
#include <map>
#include <vector>
using namespace std;
ifstream cin("elmaj.in");
ofstream cout("elmaj.out");
int main(){
int n;
cin >> n;
vector<int> v(n + 1);
map<int, int> h;
for(int i = 1; i <= n; i++){
cin >> v[i];
h[v[i]] += 1;
}
int Max = -1;
for(int i = 1; i <= n; i++){
if(h[v[i]] > h[Max])
Max = v[i];
}
if(h[Max] >= n / 2 + 1)
cout << Max << ' ' << h[Max] << '\n';
else
cout << "-1" << '\n';
}