Cod sursa(job #3236826)
| Utilizator | Data | 2 iulie 2024 16:26:40 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.73 kb |
#include "bits/stdc++.h"
inline static void solve(){
int n;
std :: cin >> n;
std :: map <int,int> m;
int cnt = 0;
int val = 0;
for(int i = 0; i < n; i++){
int x;
std :: cin >> x;
m[x]++;
if(m[x] > cnt){
cnt = m[x];
val = x;
}
}
if(cnt > n/2){
std :: cout << val << ' ' << cnt;
}else{
std :: cout << "-1";
}
}
signed main(){
freopen("elmaj.in","r",stdin);
freopen("elmaj.out","w",stdout);
std :: ios_base :: sync_with_stdio(false);
std :: cin.tie(0);
std :: cout.tie(0);
solve();
return 0;
}
