Pagini recente » Cod sursa (job #449448) | Cod sursa (job #965358) | Borderou de evaluare (job #804911) | Cod sursa (job #2069267) | Cod sursa (job #1066765)
#include <fstream>
#include <unordered_map>
using namespace std;
unordered_map<int, int> umap;
int x, n, i, nrx;
int main()
{
ifstream in("elmaj.in");
ofstream out("elmaj.out");
in >> n;
int count;
for (i = 0; i<n; i++)
{
in >> x;
umap[x]++;
if (umap[x] >= (n / 2 + 1))
{
count = umap[x];
nrx = x;
}
}
if (count>0)
out << nrx << " " << count;
else
out << -1;
in.close();
out.close();
return 0;
}