Cod sursa(job #3294345)
| Utilizator | Data | 21 aprilie 2025 20:05:31 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.75 kb |
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
ifstream fin ("elmaj.in");
ofstream fout ("elmaj.out");
int N,v[1000009];
int main()
{
fin>>N;
for(int i=1;i<=N;i++)
{
fin>>v[i];
}
int cand=v[1],nrap=1;
for(int i=2;i<=N;i++)
{
if(v[i]==cand)
{
nrap++;
}
else
{
nrap--;
}
if(nrap==0)
{
cand=v[i];
nrap=1;
}
}
int nr=0;
for(int i=1;i<=N;i++)
{
if(v[i]==cand)
{
nr++;
}
}
if(nr>=N/2+1)
{
fout<<cand<<' '<<nr<<'\n';
}
else
{
fout<<-1<<'\n';
}
return 0;
}
