Pagini recente » Cod sursa (job #1838896) | Cod sursa (job #2267051) | Cod sursa (job #2214653) | Cod sursa (job #2358874) | Cod sursa (job #2220532)
#include <fstream>
#include <map>
using namespace std;
ifstream cin("elmaj.in");
ofstream cout("elmaj.out");
int main()
{
map<int, int> m;
int n, x;
cin >> n;
int max = n/2 + 1;
int el = -1;
for(int i = 0; i < n; i++)
{
cin >> x;
auto it = m.find(x);
if(it != m.end())
m[x]++;
else
m.emplace(x, 1);
if(m[x] >= max)
{
max = m[x];
el = x;
}
}
if(el != -1)
cout << el << " " << m[el];
else
cout << -1;
}