-
Notifications
You must be signed in to change notification settings - Fork 0
/
Equalize_the_Array.cpp
90 lines (63 loc) · 1.98 KB
/
Equalize_the_Array.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
/**
* Title : Equalize the Array
* Author : Tridib Samanta
* Created : 08-06-2020
* Link : https://www.hackerrank.com/challenges/equality-in-a-array/problem
**/
#include <bits/stdc++.h>
using namespace std;
vector<string> split_string(string);
// Complete the equalizeArray function below.
int equalizeArray(vector<int> arr) {
sort(arr.begin(), arr.end());
int freq = 1, prev = arr[0], maxFreq = 1;
for (int i = 1; i < arr.size(); ++i) {
if (arr[i] == prev) {
++freq;
maxFreq = max(freq, maxFreq);
}
else
freq = 1;
prev = arr[i];
}
return (arr.size() - maxFreq);
}
int main()
{
ofstream fout(getenv("OUTPUT_PATH"));
int n;
cin >> n;
cin.ignore(numeric_limits<streamsize>::max(), '\n');
string arr_temp_temp;
getline(cin, arr_temp_temp);
vector<string> arr_temp = split_string(arr_temp_temp);
vector<int> arr(n);
for (int i = 0; i < n; i++) {
int arr_item = stoi(arr_temp[i]);
arr[i] = arr_item;
}
int result = equalizeArray(arr);
fout << result << "\n";
fout.close();
return 0;
}
vector<string> split_string(string input_string) {
string::iterator new_end = unique(input_string.begin(), input_string.end(), [] (const char &x, const char &y) {
return x == y and x == ' ';
});
input_string.erase(new_end, input_string.end());
while (input_string[input_string.length() - 1] == ' ') {
input_string.pop_back();
}
vector<string> splits;
char delimiter = ' ';
size_t i = 0;
size_t pos = input_string.find(delimiter);
while (pos != string::npos) {
splits.push_back(input_string.substr(i, pos - i));
i = pos + 1;
pos = input_string.find(delimiter, i);
}
splits.push_back(input_string.substr(i, min(pos, input_string.length()) - i + 1));
return splits;
}