fork download
copy 
  1. #include <iostream>
  2. using namespace std;
  3.  
  4. const int MAX_SIZE = 10000;
  5. const int MAX_VALUE = 500;
  6.  
  7. int main() {
  8.     int noElements, v[MAX_SIZE + 1], frq[MAX_VALUE + 1] = {0};
  9.     cin >> noElements;
  10.     for (int i = 1; i <= noElements; ++i) {
  11.         cin >> v[i];
  12.         ++frq[v[i]];
  13.     }
  14.     int mostFrElement = 0, maxFrequency = 0;
  15.     for (int i = 0; i <= MAX_VALUE; ++i) {
  16.         if (frq[i] > maxFrequency) {
  17.             maxFrequency = frq[i];
  18.             mostFrElement = i;
  19.         } else if (frq[i] == maxFrequency) {
  20.             if (i > mostFrElement) {
  21.                 mostFrElement = i;
  22.             }
  23.         }
  24.     }
  25.     cout << mostFrElement; // Afișăm elementul cu cea mai mare frecvență,sau care este cel mai mare de pe frecventa cea mai mare
  26.     return 0;
  27. }
Success #stdin #stdout 0.01s 5288KB
comments (?)
stdin
copy 
16
89 42 156 86 35 34 45 34 35 5 35 9 5 5 5 5
stdout
copy 
5
https://ideone.com/LYkXpK
language:
C++ (gcc 8.3)
created:
11 days ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!