Cod sursa(job #3284953)
| Utilizator | Data | 12 martie 2025 13:14:06 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.58 kb |
#pragma GCC optimize("O3", "Ofast", "unroll-loops")
#include<bits/stdc++.h>
using namespace std;
const int NMax=1000003;
int n, v[NMax];
void read(){
cin>> n;
for(int i=0; i<n; i+=1)
cin>> v[i];
}
void solve(){
nth_element(v, v+n/2, v+n);
int cnt=0;
for(int i=0; i<n; i+=1)
if(v[i]==v[n/2])
cnt+=1;
if(cnt>n/2)
cout<< v[n/2]<< ' '<< cnt;
}
int main(){
freopen("elmaj.in", "r", stdin);
freopen("elmaj.out", "w", stdout);
ios_base::sync_with_stdio(0);
cin.tie(0);
read();
solve();
}
