Pagini recente » Cod sursa (job #1692641) | Cod sursa (job #1719264) | Cod sursa (job #165598) | Cod sursa (job #2080223) | Cod sursa (job #1721141)
#include<fstream>
#include<map>
#include<cstdlib>
using namespace std;
ifstream f("elmaj.in");
ofstream g("elmaj.out");
int main()
{
map< int , int > aparitii;
map< int , int >::iterator it;
int i,n,raw;
f>>n;
for(i=0;i<n;++i)
{
f>>raw;
it=aparitii.find(raw);
if(it!=aparitii.end())
++(it->second);
else aparitii.insert(make_pair(raw,1));
}
it=aparitii.begin();
while(it!=aparitii.end())
{
if(it->second>n/2)
{g<<it->first<<' '<<it->second<<'\n';exit(0);}
++it;
}
g<<-1;
}