Cod sursa(job #2616502)
| Utilizator | Data | 18 mai 2020 18:32:10 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.6 kb |
#include <fstream>
using namespace std;
ifstream in ("elmaj.in");
ofstream out ("elmaj.out");
int v[1000000];
int main()
{
int n,nr=1,candidat,i;
in>>n>>v[0];
candidat=v[0];
for(i=1;i<n;i++)
{
in>>v[i];
if(v[i]==candidat)
nr++;
else
nr--;
if(nr==0)
{
candidat=v[i];
nr=1;
}
}
nr=0;
for(i=0;i<n;i++)
{
if(v[i]==candidat)
nr++;
}
if(nr<(n/2)+1)
out<<-1;
else
out<<candidat<<" "<<nr;
return 0;
}
