Cod sursa(job #3344075)
| Utilizator | Data | 1 martie 2026 12:28:44 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.48 kb |
#include<fstream>
#include<algorithm>
#include<vector>
#include<string>
#include<cmath>
using namespace std;
ifstream cin("elmaj.in");
ofstream cout("elmaj.out");
int v[1000002];
int main()
{
int n,cand=-1,cnt=0;
cin>>n;
for(int i=1;i<=n;i++){
cin>>v[i];
}
sort(v+1,v+1+n);
cand=v[n/2];
for(int i=1;i<=n;i++){
if(v[i]==cand)cnt++;
}
if(cnt>n/2)cout<<cand<<" "<<cnt;
else cout<<"-1";
return 0;
}
