fork download 
  1. #include <iostream>
  2. #include <map>
  3. #include <bits/stdc++.h>
  4. using namespace std;
  5.  
  6. int main() {
  7.     int n;
  8.     cin >> n;
  9.  
  10.     int arr[n];  //array input
  11.     for (int i = 0; i < n; i++) {
  12.         cin >> arr[i];
  13.     }
  14.  
  15.     map<int, int> mpp;
  16.  
  17.     // store frequencies for all elements
  18.     for (int i = 0; i < n; i++) {
  19.         mpp[arr[i]]++;
  20.     }
  21.  
  22.     int maxiFreq = 0, maxiElement = -1; 
  23.     int miniFreq = INT_MAX, miniElement = -1;
  24.  
  25.     // Find max and min frequency
  26.     for (auto &it : mpp) {
  27.         if (it.second > maxiFreq) {
  28.             maxiFreq = it.second;
  29.             maxiElement = it.first;
  30.         }
  31.         if (it.second < miniFreq) {
  32.             miniFreq = it.second;
  33.             miniElement = it.first;
  34.         }
  35.     }
  36.  
  37.     cout << "Max Frequency Element: " << maxiElement << " (Freq = " << maxiFreq << ")" << endl;
  38.     cout << "Min Frequency Element: " << miniElement << " (Freq = " << miniFreq << ")" << endl;
  39.  
  40.     return 0;
  41. }
  42.  
Success #stdin #stdout 0s 5320KB
comments (?)
stdin 
7
1 2 2 3 3 3 4
stdout 
Max Frequency Element: 3 (Freq = 3)
Min Frequency Element: 1 (Freq = 1)
https://ideone.com/puHmhW
hash(q2)Max and min freq in array
language:
C++ (gcc 8.3)
created:
6 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!