fork download
copy 
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3.  
  4.  
  5. int main() {
  6.     int n;
  7.     cin >> n;
  8.     vector<int> arr(n);
  9.  
  10.     for (int i = 0; i < n; i++) {
  11.         cin >> arr[i];
  12.     }
  13.  
  14.     int minEle,maxEle;
  15.     int minCount = INT_MAX , maxCount = INT_MIN;
  16.  
  17.     vector<bool>visited(n,false);
  18.  
  19.     for(int i=0;i<arr.size();i++){
  20.     	if(visited[i])continue;
  21.  
  22.     	int cnt=0;
  23.     	for(int j=i;j<arr.size();j++){
  24.     		if(arr[i]==arr[j]){
  25.     			cnt++;
  26.     			visited[j] = true;
  27.     		}
  28.     	}
  29.     	if(cnt>maxCount){
  30.     		maxCount = cnt;
  31.     		maxEle = arr[i];
  32.     	}
  33.     	if(cnt<minCount){
  34.     		minCount = cnt;
  35.     		minEle = arr[i];
  36.     	}
  37.     }
  38.  
  39.     cout<<"Max freq Element is : "<<maxEle<<" and freq is : "<<maxCount<<endl;
  40.     cout<<"Min freq Element is : "<<minEle<<" and freq is : "<<minCount<<endl;
  41.  
  42.     return 0;
  43. }
  44.  
Success #stdin #stdout 0.01s 5292KB
comments (?)
stdin
copy 
8
1 3 3 2 1 4 1 2
stdout
copy 
Max freq Element is : 1 and freq is : 3
Min freq Element is : 4 and freq is : 1
https://ideone.com/61eSvk
language:
C++ (gcc 8.3)
created:
38 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!