Cod sursa(job #2106516)
| Utilizator | Data | 15 ianuarie 2018 20:52:08 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.63 kb |
#include<fstream>
#include<iostream>
#include<cstring>
#include<algorithm>
#include<cstdlib>
#define DN 1000005
using namespace std;
ifstream fin("elmaj.in");
ofstream fout("elmaj.out");
int n,a[DN],top,r,nr;
int main()
{
fin>>n;
for(int i=1;i<=n;i++)
fin>>a[i];
nr=1;
top=a[1];
for(int i=2;i<=n;i++)
{
if(top==a[i]||nr==0)
{
top=a[i];
nr++;
}
else
nr--;
}
nr=0;
for(int i=1;i<=n;i++)
if(a[i]==top)
nr++;
if(nr>=n/2+1)
fout<<top<<' '<<nr;
else
fout<<-1;
}
