Pagini recente » Cod sursa (job #412070) | Cod sursa (job #1298574) | Cod sursa (job #2227559) | Cod sursa (job #2851487) | Cod sursa (job #1325484)
#include <fstream>
#include <unordered_map>
using namespace std;
int main()
{
int N, x, i;
ifstream f("elmaj.in");
f >> N;
unordered_map<int, int> m;
for (i = 0; i < N; i++)
{
f >> x;
m[x]++;
}
f.close();
unordered_map<int, int>::iterator it;
ofstream g("elmaj.out");
bool found = false;
for (it = m.begin(); it != m.end() && !found; it++)
{
if (it->second == N / 2 + 1)
{
g << it->first << " " << it->second;
found = true;
}
}
if (!found)
g << -1;
g.close();
return 0;
}