Cod sursa(job #1812287)
| Utilizator | Data | 21 noiembrie 2016 22:35:25 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.53 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("elmaj.in");
ofstream g("elmaj.out");
int n,v[1000000];
void majority()
{int cand=-1,k=0;
for(int i=1;i<=n;i++)
if(k==0){cand=v[i];k=1;}
else if(v[i]==cand)k++;
else k--;
if(cand<0)g<<-1;
int nr=0;
for(int i=1;i<=n;i++)
if(v[i]==cand)nr++,k=v[i];
if(nr>n/2)g<<nr<<" "<<k;
else g<<-1;
}
int main()
{
in>>n;
for(int i=1;i<=n;i++)
in>>v[i];
majority();
}
