aboutsummaryrefslogtreecommitdiff
path: root/Equalize_the_array
diff options
context:
space:
mode:
authorOmar Magdy <omar.professional8777@gmail.com>2022-05-30 00:18:17 +0200
committerOmar Magdy <omar.professional8777@gmail.com>2022-05-30 00:18:17 +0200
commit3a89fc707253f75f46fd5a4822817f1fd5156c40 (patch)
tree474b08b187895af91c10838aae21142b2ba2514d /Equalize_the_array
parentf5ff62a26052f084b6b807cba220c86785fd45e3 (diff)
downloadcompetitive-programming-3a89fc707253f75f46fd5a4822817f1fd5156c40.tar.xz
competitive-programming-3a89fc707253f75f46fd5a4822817f1fd5156c40.zip
Made that every problem is its own folder to make building the code a smooth operation with a shortcut
Diffstat (limited to 'Equalize_the_array')
-rw-r--r--Equalize_the_array/Equalize_the_array.cpp19
1 files changed, 19 insertions, 0 deletions
diff --git a/Equalize_the_array/Equalize_the_array.cpp b/Equalize_the_array/Equalize_the_array.cpp
new file mode 100644
index 0000000..89af0d8
--- /dev/null
+++ b/Equalize_the_array/Equalize_the_array.cpp
@@ -0,0 +1,19 @@
+#include<bits/stdc++.h>
+
+using namespace std;
+
+int main(){
+ int n, x;
+ cin >> n;
+ map<int, int> mp;
+ vector<int> freq;
+ for(int i =0; i < n; i++){
+ cin >> x;
+ mp[x]++;
+ }
+ for(auto x : mp){
+ freq.push_back(x.second);
+ }
+ cout << n - *max_element(freq.begin(), freq.end()) << '\n';
+ return 0;
+}