Cod sursa(job #3273899)
| Utilizator | Data | 4 februarie 2025 12:52:21 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 60 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.77 kb |
#include <bits/stdc++.h>
#define int long long
using namespace std;
int v[100005];
signed main()
{
ifstream cin("elmaj.in");
ofstream cout("elmaj.out");
int n,cnt=0,candidat=0;
cin >> n;
for(int i=1;i<=n;i++)
{
cin >> v[i];
}
for(int i=1;i<=n;i++)
{
if(cnt==0)
{
candidat=v[i];
cnt++;
}
else
{
if(candidat==v[i])
cnt++;
else
{
cnt--;
}
}
}
cnt=0;
for(int i=1;i<=n;i++)
{
if(v[i]==candidat)
cnt++;
}
if(cnt<(n/2)+1)
cout << -1;
else
cout << candidat << " " << cnt;
return 0;
}
