fork download
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3.  
  4. int main() {
  5. // your code goes here
  6. int n[]={1,2,1,4,3,1};
  7. int s=sizeof(n)/sizeof(n[1]);
  8. int maxfreq=-100;
  9. int freq=0;
  10. unordered_map<int,int>um;
  11. for(int i=0;i<s;i++){
  12. um[n[i]]=um[n[i]]+1;
  13. }
  14. for(int i=0;i<s;i++){
  15. if(um[n[i]]>maxfreq){
  16. maxfreq=um[n[i]];
  17. }
  18. }
  19. int ans=s-maxfreq;
  20. cout<<"Minimum operation to make all elements of array equal is:"<<ans<<endl;
  21.  
  22. return 0;
  23. }
Success #stdin #stdout 0.01s 5320KB
stdin
Standard input is empty
stdout
Minimum operation to make all elements of array equal is:3