Cod sursa(job #1879927)
Utilizator | Data | 15 februarie 2017 11:38:43 | |
---|---|---|---|
Problema | Elementul majoritar | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include <fstream>
using namespace std;
int main(){
int bruteForceMajority(int n, int[] a)
for (int i = 0; i < n; i++) {
int nr = 0;
for (int j = 0; j < n; j++) {
if (a[j]==a[i])
nr++;
}
if (nr > n / 2)
return a[i];
}
return -1;
}