Pagini recente » Cod sursa (job #2281578) | Cod sursa (job #2379226) | Cod sursa (job #2500275) | Cod sursa (job #2370082) | Cod sursa (job #1084023)
#include<iostream>
#include<fstream>
#include<algorithm>
#include<string>
#include<vector>
#include<map>
using namespace std;
ifstream f("elmaj.in");
ofstream g("elmaj.out");
int main(){
int n,i,x;
int m,r=-1;
map<int , int> a;
map<int ,int>::iterator it;
f>>n; m=n/2;
for(i=1; i<=n; ++i){
f>>x;
if(a.find(x)->first>0)
a.insert(pair<int ,int>(x,0));
a[x]++;
if(a[x]>m){
m=a[x];
r=x;
}
}
/*
for(it=a.begin(); it!=a.end(); ++it){
if(it->second >= m) {
r=it->first;
x=it->second;
break;
}
}
*/
if(r!=-1)
g<<r<<" "<<m;
else
g<<"-1";
return 0;
}