-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path767a.cpp
51 lines (42 loc) · 921 Bytes
/
767a.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
#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>;
void solve() {
ll n, k;
cin >> n >> k;
vector<array<ll, 3>> a(n);
for(ll i = 0; i < n; i++) {
cin >> a[i][1];
a[i][2] = true;
}
for(ll i = 0; i < n; i++) {
cin >> a[i][0];
}
sort(a.begin(), a.end());
reverse(a.begin(), a.end());
while(true) {
bool works = false;
for (ll i = 0; i < n; i++) {
if(a[i][2] && (k >= a[i][1])) {
a[i][2] = false;
k += a[i][0];
works = true;
break;
}
}
if (!works) break;
}
cout << k << endl;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll t;
cin >> t;
while(t--) solve();
return 0;
}