Pagini recente » Cod sursa (job #1627993) | Cod sursa (job #405503) | Borderou de evaluare (job #804546) | Istoria paginii runda/alteproblemegogule/clasament | Cod sursa (job #2389172)
#include <fstream>
#include <unordered_map>
using namespace std;
ifstream f("elmaj.in");
ofstream g("elmaj.out");
int n,x,minim, ans;
unordered_map <int, int> mymap;
int main()
{
f >> n;
minim = (n/2) + 1;
for(int i = 1; i <= n; ++ i)
{
f >> x;
mymap[x]++;
if(mymap[x] >= minim && ans == 0)
{
ans = x;
}
}
if(!ans)
g << -1;
else
g << ans << ' ' << mymap[ans];
f.close(); g.close();
return 0;
}