Pagini recente » Cod sursa (job #2907373) | Cod sursa (job #2414511) | Cod sursa (job #942367) | Cod sursa (job #711182) | Cod sursa (job #639311)
Cod sursa(job #639311)
#include<fstream>
#include<map>
using namespace std;
ifstream fin("elmaj.in");
ofstream fout("elmaj.out");
map<int,int> hh ;
int n;
void Solve()
{
fin>>n;
int x, i;
for( i=1;i<=n;++i)
{
fin>>x;
if( hh.find(x) == hh.end() )
{
hh.insert(make_pair(x,1));
}
else
++hh[x];
}
}
void Afisare()
{
map<int,int>::iterator it;
n= n/2 + 1;
for ( it = hh.begin() ; it != hh.end(); ++it )
if((*it).second >= n )
{
fout<<(*it).first<<" "<< (*it).second << endl;
return ;
}
fout<<-1<<endl;
}
int main()
{
Solve();
Afisare();
fout.close();
fin.close();
return 0;
}