fork download
  1. #include <iostream>
  2. #include <vector>
  3. #include <algorithm>
  4. using namespace std;
  5.  
  6. int main() {
  7. int n, ans;
  8. int anscount = 1;
  9. int count = 1;
  10. cin >> n;
  11. vector<long long> a(n);
  12.  
  13. for (int i = 0; i < n; i++) {
  14. scanf("%lld", &a[i]);
  15. }
  16.  
  17. sort(a.begin(), a.end());
  18.  
  19. ans = a[0];
  20.  
  21. for (int i = 1; i < n; i++) {
  22.  
  23. if (ans == a[i]) {
  24. anscount++;
  25. }
  26.  
  27. if (a[i] != a[i - 1]) {
  28. count = 1;
  29. }
  30.  
  31. if (a[i] == a[i - 1] && ans!=a[i]) {
  32. count++;
  33. }
  34.  
  35. if (count > anscount) {
  36. anscount = count;
  37. count = 1;
  38. ans = a[i];
  39. }
  40. }
  41.  
  42. cout << ans;
  43.  
  44. return 0;
  45. }
  46.  
Success #stdin #stdout 0s 15240KB
stdin
1
999999999999
stdout
-727379969