Cod sursa(job #1851391)
| Utilizator | Data | 19 ianuarie 2017 18:06:40 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.49 kb |
#include <fstream>
#define nmax 1000001
using namespace std;
ifstream fin("elmaj.in");
ofstream fout("elmaj.out");
int a[nmax],n;
int main()
{ int i,maj,vot,ct;
fin>>n;
for(i=1;i<=n;i++) fin>>a[i];
maj=a[1]; vot=1;
for(i=2;i<=n;i++)
if(a[i]==maj) vot++;
else if(vot>0) vot--;
else {maj=a[i]; vot=1;}
ct=0;
for(i=1;i<=n;i++)
if(a[i]==maj) ct++;
if(ct>=n/2+1) fout<<maj<<" "<<ct;
else fout<<"-1";
return 0;
}
