Cod sursa(job #3286619)
| Utilizator | Data | 14 martie 2025 14:21:16 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.61 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("elmaj.in");
ofstream fout("elmaj.out");
int main()
{
int v[1000001], n;
fin >> n;
for(int i=1; i<=n; i++)
fin >> v[i];
int k=v[1], cnt=1;
for(int i=2; i<=n; i++)
{
if(v[i]==k)
cnt++;
else
cnt--;
if(cnt<0)
{
cnt=1;
k=v[i];
}
}
cnt=0;
for(int i=1; i<=n; i++)
if(v[i]==k)
cnt++;
if(cnt>=n/2+1)
fout << k << " " << cnt;
else
fout << "-1";
return 0;
}
