Cod sursa(job #2460452)
| Utilizator | Data | 23 septembrie 2019 19:03:05 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.56 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("elmaj.in");
ofstream g("elmaj.out");
int n,v[1000005];
int main()
{
f>>n;
for(int i=1;i<=n;i++)
f>>v[i];
int ap=0,cand=0,cont=0;
for(int i=1;i<=n;i++)
{
if(cont==0)
{
cand=v[i];
cont=1;
}
else
if(v[i]==cand)cont++;
else cont--;
}
for(int i=1;i<=n;i++)
if(v[i]==cand)ap++;
if(ap<n/2-1)
g<<-1;
else g<<cand<<' '<<ap;
g.close();
return 0;
}
