Cod sursa(job #2849860)
Utilizator | Carina Maria Viespescu carinamaria | Data | 15 februarie 2022 21:19:48 |
---|---|---|---|
Problema | Elementul majoritar | Scor | 60 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.53 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream cin("elmaj.in");
ofstream cout("elmaj.out");
int i, j, n, m, G, sol, maxim, maximap, nr, v[100005];
int main () {
cin>>n;
for(i=1;i<=n;i++)
cin>>v[i];
sort(v+1, v+n+1);
nr=1;
for(i=1;i<=n;i++){
if(v[i]==v[i-1])
nr++;
else{
if(nr>=n/2+1){
maxim=v[i-1];
maximap=nr;
}
nr=1;
}
}
cout<<maxim<<" "<<maximap;
}