#include <iostream> #include <unordered_map> int main() { int n, x; while(~scanf("%d", &n)){ std::unordered_map<int, int> umap; while(n--){ scanf("%d", &x); umap[x]++; } int maxx = 0; int val = 0; for(auto i : umap){ if(maxx < i.second){ maxx = i.second; val = i.first; } } printf("%d\n", val); } return 0; }
通过70%。
#include <iostream> #include <unordered_map> #include <vector> int main() { int n, x; while(~scanf("%d", &n)){ // std::unordered_map<int, int> umap; std::vector<int> vec; while(n--){ scanf("%d", &x); vec.emplace_back(x); } int sum = 0; int val = vec[0]; for(auto i : vec){ int suma = 0; for(auto j : vec){ if(j == i) suma++; } if(suma > sum){ sum = suma; val = i; } } printf("%d\n", val); } return 0; }AC
全部评论
(2) 回帖