Cod sursa(job #2657845)
Utilizator | Mirt Leonard Leonard123 | Data | 12 octombrie 2020 13:35:21 |
---|---|---|---|
Problema | Elementul majoritar | Scor | 90 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include<fstream>
#include<map>
using namespace std;
map <int , int> money;
ifstream cin("elmaj.in");
ofstream cout("elmaj.out");
int main(){
int n, x, maxim = 0, banknote;
cin >> n;
while(n--) {
cin >> x;
money[x]++;
if(money[x] > maxim) {
banknote = x;
maxim = money[x];
}
}
if(maxim > (n + 1) / 2)
cout << banknote << " " << maxim;
else
cout << -1;
return 0;
}