Pagini recente » Cod sursa (job #2329406) | Cod sursa (job #625588) | Cod sursa (job #2571310) | Cod sursa (job #2033021) | Cod sursa (job #1338953)
#include <iostream>
#include <fstream>
#include <map>
using namespace std;
ifstream f("elmaj.in");
ofstream g("elmaj.out");
map<unsigned long long , unsigned int> fr;
int main()
{
int n, maxi = 0;
long long x, k;
f>>n;
for(int i = 1 ; i <= n ; ++i){
f>>k;
++fr[k];
if(fr[k] >= n / 2){
x = k;
maxi = fr[k];
continue;
}
else
if(fr[k] > maxi){
maxi = fr[k];
x = k;
}
}
cout<<x<<' '<<maxi;
return 0;
}