Pagini recente » Cod sursa (job #2466640) | Monitorul de evaluare | Profil Ramona2007 | Cod sursa (job #2535145) | Cod sursa (job #1991143)
#include <fstream>
#include <unordered_map>
using namespace std;
ifstream cin("elmaj.in");
ofstream cout("elmaj.out");
int main(){
int n;
cin >> n;
unordered_map<int, int> h;
for(int i = 1; i <= n; i++){
int a;
cin >> a;
h[a] += 1;
}
ifstream fin("elmaj.in");
int nn;
fin >> nn;
int Max = -1;
for(int j = 1; j <= nn; j++){
int a;
fin >> a;
if(h[a] > Max)
Max = a;
}
if(h[Max] >= nn / 2 + 1)
cout << Max << ' ' << h[Max] << '\n';
else
cout << "-1" << '\n';
}