Pagini recente » Cod sursa (job #301724) | Cod sursa (job #1731665) | Cod sursa (job #757168) | Cod sursa (job #1469313) | Cod sursa (job #1069255)
#include <fstream>
#include <unordered_map>
using namespace std;
int main()
{
int n,i,k=0;
long long x;
ifstream f("elmaj.in");
ofstream g("elmaj.out");
unordered_map<int,int> nr;
unordered_map<int,int>::iterator it;
f>>n;
for (i=1;i<=n;i++)
{
f>>x;
nr[x]++;
}
for (it=nr.begin();it!=nr.end();it++)
if (it->second>=n/2+1)
{
g<<it->first<<" "<<it->second;
k=1;
}
if (k==0)
g<<-1;
f.close();
g.close();
return 0;
}