Cod sursa(job #3314290)
| Utilizator | Data | 9 octombrie 2025 10:55:23 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.46 kb |
#include <fstream>
#include <algorithm>
#include <vector>
#include <map>
using namespace std;
ifstream cin("elmaj.in");
ofstream cout("elmaj.out");
map<int , int >m;
int v[1005];
int main(){
int n;
cin>>n;
//cout<<n/2+1<<endl;
for(int i=0;i<n;i++){
cin>>v[i];
m[v[i]]++;
}
bool vef=false;
for(int i=0;i<n;i++){
if(m[v[i]]>=(n/2+1)){
vef=true;
cout<<v[i]<<" "<<m[v[i]]<<endl;
}
}
if(vef==false){
cout<<-1;}
}
