fork download
copy 
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3.  
  4. int main() {
  5.     int n;
  6.     cin >> n;
  7.     vector<int> arr(n);
  8.  
  9.     for (int i = 0; i < n; i++) {
  10.         cin >> arr[i];
  11.     }
  12.  
  13.     unordered_map<int, int> freq;
  14.  
  15.     // Count occurrences of each element
  16.     for (int num : arr) {
  17.         freq[num]++;
  18.     }
  19.  
  20.     int minEle = -1, maxEle = -1;
  21.     int minCount = INT_MAX, maxCount = 0;
  22.  
  23.     // Find min and max frequency elements
  24.     for (auto it : freq) {
  25.         if (it.second > maxCount) {
  26.             maxCount = it.second;
  27.             maxEle = it.first;
  28.         }
  29.         if (it.second < minCount) {
  30.             minCount = it.second;
  31.             minEle = it.first;
  32.         }
  33.     }
  34.  
  35.     cout << "Max freq Element is : " << maxEle << " and freq is : " << maxCount << endl;
  36.     cout << "Min freq Element is : " << minEle << " and freq is : " << minCount << endl;
  37.  
  38.     return 0;
  39. }
  40.  
Success #stdin #stdout 0.01s 5288KB
comments (?)
stdin
copy 
7
1 2 1 2 1 5 4
stdout
copy 
Max freq Element is : 1 and freq is : 3
Min freq Element is : 4 and freq is : 1
https://ideone.com/Y131mQ
language:
C++ (gcc 8.3)
created:
40 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!