Cod sursa(job #2374660)
| Utilizator | Data | 7 martie 2019 19:51:35 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.56 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("elmaj.in");
ofstream out("elmaj.out");
const int NMAX = 1e6;
int n;
int val, ap;
int v[1 + NMAX];
int main()
{
in >> n;
for(int i = 1; i <= n; i++) {
in >> v[i];
if(v[i] == val)
ap++;
else
ap--;
if(ap < 0) {
val = v[i];
ap = 1;
}
}
ap = 0;
for(int i = 1; i <= n; i++)
if(v[i] == val)
ap++;
if(ap >= (n / 2 + 1))
out << val << ' ' << ap << '\n';
else
out << "-1\n";
in.close();
out.close();
return 0;
}
