Pagini recente » Cod sursa (job #1060397) | Cod sursa (job #2024479) | Cod sursa (job #1644281) | Cod sursa (job #1800089) | Cod sursa (job #1050288)
#include <iostream>
#include <fstream>
#include <unordered_map>
std::ifstream fin("elmaj.in");
std::ofstream fout("elmaj.out");
int n;
std::unordered_map<int, int> aparitii;
void citire()
{
fin>>n;
int x;
int nr = 0;
long long maxim = -1, indice;
for(int i = 0; i < n; i++)
{
fin>>x;
aparitii[x]++;
if(aparitii[x] > maxim)
{
maxim = aparitii[x];
indice = x;
nr = 0;
}
else
if(aparitii[x] == maxim)
{
nr++;
}
}
if(nr == 0)
{
fout<<x<<' '<<maxim<<'\n';
}
else
{
fout<<-1<<'\n';
}
}
void rezolvare()
{
}
int main()
{
citire();
rezolvare();
return 0;
}