fork download
copy 
  1. #include <iostream>
  2. #include <map>
  3. using namespace std;
  4.  
  5. int main() 
  6. {
  7.     int n;
  8.     cin >> n;
  9.  
  10.     int arr[n];  // Declare array after reading n
  11.  
  12.     // Input array elements
  13.     for (int i = 0; i < n; i++) {
  14.         cin >> arr[i];
  15.     }
  16.  
  17.     map<int, int> mp;
  18.  
  19.     // Count frequencies
  20.     for (int i = 0; i < n; i++) {
  21.         mp[arr[i]]++;
  22.     }
  23.  
  24.     // Initialize frequency tracking
  25.     int maxiFreq = 0, miniFreq = n + 1;
  26.     int maxiElement = -1, miniElement = -1;
  27.  
  28.     for (auto it : mp) {
  29.         int element = it.first;
  30.         int freq = it.second;
  31.  
  32.         if (freq > maxiFreq) {
  33.             maxiFreq = freq;
  34.             maxiElement = element;
  35.         }
  36.  
  37.         if (freq < miniFreq) {
  38.             miniFreq = freq;
  39.             miniElement = element;
  40.         }
  41.     }
  42.  
  43.     cout << "Most frequent element: " << maxiElement << " (Frequency: " << maxiFreq << ")" << endl;
  44.     cout << "Least frequent element: " << miniElement << " (Frequency: " << miniFreq << ")" << endl;
  45.  
  46.     return 0;
  47. }
  48.  
Success #stdin #stdout 0s 5324KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
Most frequent element: 0 (Frequency: 4766)
Least frequent element: -2078277632 (Frequency: 1)
https://ideone.com/Vstz5q
language:
C++ (gcc 8.3)
created:
8 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!