Pagini recente » Cod sursa (job #952679) | cgfhfjdkfyul | Cod sursa (job #653808) | Cod sursa (job #494806) | Cod sursa (job #2261792)
#include <iostream>
#include <fstream>
#include <algorithm>
#include <climits>
using namespace std;
ifstream in("elmaj.in");
ofstream out("elmaj.out");
long long x, v[1000001] ,fr[100001], maxim=0, minim=2000000001;
int main()
{
in>>x;
for(int i=1;i<=x;i++){
in>>v[i];
fr[v[i]]++;
if(maxim<v[i]){
maxim=v[i];
}
if(minim>v[i]){
minim=v[i];
}
}
for(int i=minim;i<=maxim;i++){
if(fr[i]>=x/2+1){
out<<i<<" "<<fr[i];
//break;
}
}
in.close();
out.close();
}