Cod sursa(job #2325854)
| Utilizator | Data | 22 ianuarie 2019 23:27:50 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Teme Pregatire ACM Unibuc 2013 | Marime | 0.72 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("elmaj.in");
ofstream g("elmaj.out");
int a[1000001];
int main()
{
int n, nr = 0, cand = -1;
f >> n;
for(int i = 1; i <= n; i++)
f >> a[i];
for(int i = 1; i <= n; i++)
if(nr == 0)
{
cand = a[i];
nr = 1;
}
else if(a[i] == cand)
nr++;
else
nr--;
if(nr == 0)
g << -1;
else
{
nr = 0;
for(int i = 1; i <= n; i++)
if(cand == a[i])
nr++;
if(nr > n / 2)
g << cand << ' ' << nr;
else
g << -1;
}
return 0;
}
