-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathcowculus.cpp
59 lines (46 loc) · 990 Bytes
/
cowculus.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
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pi = pair<ll, ll>;
using vi = vector<ll>;
using vpi = vector<pi>;
using vb = vector<bool>;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n, k;
cin >> n >> k;
ll good = 0, bad = 0;
vi a(n);
vi g;
vi b;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (a[i] >= 93) {
good++;
g.push_back(a[i]);
} else {
bad++;
b.push_back(a[i]);
}
}
sort(g.begin(), g.end());
sort(b.begin(), b.end());
ll ok = good * k;
ll val = max(0ll, bad - ok);
vi ans;
for (int i = 0; i < val; i++) {
cout << b[i] << " ";
}
ll l, r;
l = 0;
r = val;
while(l < g.size()) {
cout << g[l++] << " ";
ll up_bound = min((ll)b.size(), r + k);
while(r < up_bound) {
cout << b[r++] << " ";
}
}
return 0;
}