Cod sursa(job #2719664)
| Utilizator | Data | 10 martie 2021 09:21:51 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.61 kb |
#include <fstream>
using namespace std;
ifstream in("elmaj.in");
ofstream out("elmaj.out");
int a[1000001];
int main()
{
int n, candidat;
in>>n>>a[1];
candidat=a[1];
int nrap=1;
for(int i=2;i<=n;i++)
{
in>>a[i];
if(a[i]==candidat)
nrap++;
else
nrap--;
if(nrap==0)
{
candidat=a[i];
nrap=1;
}
}
nrap=0;
for(int i=1;i<=n;i++)
if(a[i]==candidat)
nrap++;
if(nrap>n/2)
out<<candidat<<" "<<nrap;
else
out<<-1;
return 0;
}
