-
Notifications
You must be signed in to change notification settings - Fork 0
/
B.cpp
47 lines (41 loc) · 1.09 KB
/
B.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
// Problem: B. The Great Hero
// Contest: Codeforces - Codeforces Round #700 (Div. 2)
// URL: https://codeforces.com/contest/1480/problem/B
// Memory Limit: 512 MB
// Time Limit: 2000 ms
// Powered by CP Editor (https://github.com/cpeditor/cpeditor)
#include <bits/stdc++.h>
using namespace std;
const int MAX = 200007;
const int MOD = 1000000007;
void solve() {
long long A, B;
int n;
cin >> A >> B >> n;
pair<long long, long long> a[n + 7];
long long mx = -1;
for (int i = 0; i < n; i++) {
cin >> a[i].first;
}
for (int i = 0; i < n; i++) {
cin >> a[i].second;
}
sort(a, a + n);
for (int i = 0; i < n; i++) {
long long num = (a[i].second + A - 1) / A;
B -= num * a[i].first;
if (B <= 0 && i < n - 1) {cout << "NO" << endl; return;}
else if (B <= 0 && i == n - 1) {
B += a[n - 1].first;
if (B <= 0) {cout << "NO" << endl; return;}
}
}
cout << "YES" << endl;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
//freopen("in.in", "r", stdin); freopen("out.out", "w", stdout);
int tt; cin >> tt; for (int i = 1; i <= tt; i++) {solve();}
//solve();
}