Cod sursa(job #2312347)
Utilizator | Data | 4 ianuarie 2019 18:46:44 | |
---|---|---|---|
Problema | Elementul majoritar | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.49 kb |
#include <bits/stdc++.h>
#define N 1000005
using namespace std;
ifstream fin("elmaj.in");
ofstream fout("elmaj.out");
int a[N], n;
int main()
{
int i, ct, cand;
fin>>n;
for(i=1;i<=n;++i) fin>>a[i];
cand=a[1]; ct=1;
for(i=2;i<=n;++i)
if(a[i]==cand) ct++;
else if(ct>0) ct--;
else {cand=a[i]; ct=1;}
ct=0;
for(i=1;i<=n;++i)
if(a[i]==cand) ct++;
if(ct>n/2) fout<<cand<<" "<<ct;
else fout<<-1;
return 0;
}