#include <bits/stdc++.h>
using namespace std;
int main() {
// your code goes here
int n[]={1,2,1,4,3,1};
int s=sizeof(n)/sizeof(n[1]);
int maxfreq=-100;
int freq=0;
unordered_map<int,int>um;
for(int i=0;i<s;i++){
um[n[i]]=um[n[i]]+1;
}
for(int i=0;i<s;i++){
if(um[n[i]]>maxfreq){
maxfreq=um[n[i]];
}
}
int ans=s-maxfreq;
cout<<"Minimum operation to make all elements of array equal is:"<<ans<<endl;
return 0;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CiAKaW50IG1haW4oKSB7CgkvLyB5b3VyIGNvZGUgZ29lcyBoZXJlCglpbnQgbltdPXsxLDIsMSw0LDMsMX07CglpbnQgcz1zaXplb2Yobikvc2l6ZW9mKG5bMV0pOwoJaW50IG1heGZyZXE9LTEwMDsKCWludCBmcmVxPTA7Cgl1bm9yZGVyZWRfbWFwPGludCxpbnQ+dW07Cglmb3IoaW50IGk9MDtpPHM7aSsrKXsKCQl1bVtuW2ldXT11bVtuW2ldXSsxOwoJfQoJZm9yKGludCBpPTA7aTxzO2krKyl7CgkJaWYodW1bbltpXV0+bWF4ZnJlcSl7CgkJCW1heGZyZXE9dW1bbltpXV07CgkJfQoJfQoJaW50IGFucz1zLW1heGZyZXE7Cgljb3V0PDwiTWluaW11bSBvcGVyYXRpb24gdG8gbWFrZSBhbGwgZWxlbWVudHMgb2YgYXJyYXkgZXF1YWwgaXM6Ijw8YW5zPDxlbmRsOwogCglyZXR1cm4gMDsKfQ==