Cod sursa(job #3192381)
Utilizator | Data | 12 ianuarie 2024 14:43:45 | |
---|---|---|---|
Problema | Elementul majoritar | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream in("elmaj.in");
ofstream out("elmaj.out");
map <int,int>m;
int main()
{
int n;
in>>n;
for(int i=1;i<=n;i++){
int x;
in>>x;
m[x]++;
}
int mid=(n/2)+1;
bool ok=0;
int bun;
for(auto k : m){
if(k.second >= mid){
out<<k.first<<" "<<k.second;
}
}
return 0;
}