forked from ngthanhtrung23/CompetitiveProgramming
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathC.cpp
More file actions
54 lines (43 loc) · 1.38 KB
/
C.cpp
File metadata and controls
54 lines (43 loc) · 1.38 KB
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
#include <bits/stdc++.h>
#define FOR(i,a,b) for(int i=(a),_b=(b); i<=_b; i++)
#define FORD(i,a,b) for(int i=(a),_b=(b); i>=_b; i--)
#define REP(i,a) for(int i=0,_a=(a); i<_a; i++)
#define EACH(it,a) for(__typeof(a.begin()) it = a.begin(); it != a.end(); ++it)
#define DEBUG(x) { cout << #x << " = "; cout << (x) << endl; }
#define PR(a,n) { cout << #a << " = "; FOR(_,1,n) cout << a[_] << ' '; cout << endl; }
#define PR0(a,n) { cout << #a << " = "; REP(_,n) cout << a[_] << ' '; cout << endl; }
#define sqr(x) ((x) * (x))
#define ll long long
#define SZ(X) ((int) ((X).size()))
using namespace std;
const int MN = 100111;
vector<int> ls[11];
int a[MN], n, k;
int main() {
ios :: sync_with_stdio(false);
while (cin >> n >> k) {
FOR(i,0,10) ls[i].clear();
FOR(i,1,n) {
cin >> a[i];
if (a[i] == 100) continue;
int t = 10 - a[i] % 10;
ls[t].push_back(i);
}
REP(t,10) {
for(auto x : ls[t]) {
if (k < t) break;
a[x] += t;
k -= t;
}
}
FOR(i,1,n) {
while (a[i] < 100 && a[i] % 10 == 0 && k >= 10) {
k -= 10;
a[i] += 10;
}
}
int sum = 0;
FOR(i,1,n) sum += a[i] / 10;
cout << sum << endl;
}
}