Pagini recente » Cod sursa (job #2835907) | Cod sursa (job #1396135) | Cod sursa (job #1814784) | Cod sursa (job #2931329) | Cod sursa (job #1050296)
#include <iostream>
#include <fstream>
//#include <unordered_map>
#include <map>
std::ifstream fin("elmaj.in");
std::ofstream fout("elmaj.out");
int n;
//std::unordered_map<int, int> aparitii;
std::map<long long, int> aparitii;
void citire()
{
fin>>n;
long long x;
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;
}
if(maxim >= n / 2 + 1)
{
break;
}
}
if(aparitii[x] >= n / 2 + 1)
{
std::cout<<indice<<' '<<maxim<<'\n';
}
else
{
std::cout<<-1<<'\n';
}
}
void rezolvare()
{
}
int main()
{
citire();
rezolvare();
return 0;
}