Cod sursa(job #1247842)
| Utilizator | Data | 24 octombrie 2014 09:28:58 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 90 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.39 kb |
#include <fstream>
#include <unordered_map>
using namespace std;
ifstream in("elmaj.in");
ofstream out("elmaj.out");
int main(){
unordered_map<int, int> nums;
int n, i, x, maxx;
in >> n;
in >> x;
++nums[x];
maxx = x;
for (i = 1; i < n; ++i){
in >> x;
++nums[x];
if (nums[x]>nums[maxx]){
maxx = x;
}
}
out << maxx << " " << nums[maxx];
return 0;
}
