Cod sursa(job #3305699)
| Utilizator | Data | 4 august 2025 11:29:06 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.56 kb |
#include <fstream>
#include <vector>
using namespace std;
int main() {
ifstream f("elmaj.in");
ofstream g("elmaj.out");
int n;
f >> n;
vector<int> v(n+1);
int candidat, cnt = 0;
for(int i = 1; i <= n; i ++) {
f >> v[i];
if(cnt == 0)
candidat = v[i];
if(candidat == v[i])
cnt ++;
else
cnt --;
}
cnt = 0;
for(int i : v)
if(i == candidat)
cnt++;
if(cnt > n/2)
g << candidat << ' ' << cnt;
else
g << -1;
return 0;
}