Cod sursa(job #3199042)
Utilizator | Data | 31 ianuarie 2024 13:35:33 | |
---|---|---|---|
Problema | Elementul majoritar | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include<fstream>
#include<unordered_map>
using namespace std;
ifstream fin("elmaj.in");
ofstream fout("elmaj.out");
int main(){
int n, a[1000001];
unordered_map<int, int> v;
fin>>n;
for(int i=1;i<=n;i++){
fin>>a[i];
v[a[i]]++;
}
for(auto x:v){
if(x.second>=n/2+1){
fout<<x.first<<" "<<x.second;
}
}
return 0;
}