-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathEqual.cpp
53 lines (35 loc) · 848 Bytes
/
Equal.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
/**
* Title : Equal
* Author : Tridib Samanta
* Link : https://www.hackerrank.com/challenges/equal/problem
**/
#include<bits/stdc++.h>
using namespace std;
void solve() {
int n;
cin >> n;
vector<int> vals(n);
for (int i = 0; i < n; ++i) {
cin >> vals[i];
}
int min_ele = *min_element(vals.begin(), vals.end());
int ans = INT_MAX;
for (int i = 0; i <= 2; ++i) {
int curr_ops = 0;
for (int j = 0; j < n; ++j) {
int diff = vals[j] - min_ele + i;
curr_ops += diff / 5 + diff % 5 / 2 + diff % 5 % 2 / 1;
}
ans = min(ans, curr_ops);
}
cout << ans;
}
int main() {
int tc;
cin >> tc;
while (tc--) {
solve();
cout << '\n';
}
return 0;
}