Cod sursa(job #2261792)
| Utilizator | Data | 16 octombrie 2018 18:04:42 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.58 kb |
#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();
}
