Pagini recente » Istoria paginii runda/test_unu/clasament | Istoria paginii runda/test_durata | Cod sursa (job #2928466) | Cod sursa (job #682129) | Cod sursa (job #1996057)
#include <iostream>
#include <fstream>
#include <map>
#include <unordered_map>
using namespace std;
ifstream in("elmaj.in");
ofstream out("elmaj.out");
const int NMax = 1e6 + 5;
int N;
int v[NMax];
map<int,int> mp;
int main() {
in>>N;
for (int i=1;i <= N;++i) {
in>>v[i];
++mp[v[i]];
}
for (int i=1;i <= N;++i) {
if (mp[v[i]] > N/2) {
out<<v[i]<<' '<<mp[v[i]]<<'\n';
return 0;
}
}
out<<"-1\n";
in.close();out.close();
return 0;
}