Cod sursa(job #1756005)
Utilizator | Data | 11 septembrie 2016 16:52:14 | |
---|---|---|---|
Problema | Elementul majoritar | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include<bits/stdc++.h>
using namespace std;
#define in f
#define out g
ifstream f ("elmaj.in");
ofstream g ("elmaj.out");
int n;
int v[1000010];
int h[1000010];
int k;
int maj() {
for(int i = 1; i <= k; i++) {
if(h[i] > n / 2) {
return i;
}
}
}
int main() {
in >> n;
for(int i = 1; i <= n; ++i) {
in >> v[i];
h[v[i]]++;
k = max(k, v[i]);
}
out << maj();
}