Cod sursa(job #3344076)
| Utilizator | Data | 1 martie 2026 12:30:46 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.67 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];
if(cnt==0){
cand=v[i];
cnt=1;
}
else if(cand==v[i])cnt++;
else cnt--;
}
if(cnt>0){
int tmp=0;
for(int i=1;i<=n;i++){
if(v[i]==cand)tmp++;
}
if(tmp>n/2)cout<<cand<<" "<<tmp;
else cout<<"-1";
}
else cout<<"-1";
return 0;
}
