- 1python打包windows服务 开机自启动守护进程_python项目设置在windows server下开机自启
- 210分钟构建本地知识库，让 ChatGPT 更加懂你_本地知识库 gpt python
- 3有向图：检测是否存在环-拓扑排序算法_检测和提取有向图中的环
- 4JS 随机生成一个五位以内的数，然后输出该数共有多少位，每位分别是什么_随机生成一个五位以内的数,然后输出该数共有多少位,每位分别是什么
- 5Swagger 教程_springfox-bean-validators
- 6FLASK+VUE+axios前后端交互_axios flask
- 7matlab实现-合成孔径雷达(SAR)-后向投影算法(BP算法)公式分析-完整代码-详解_后向投影算法 code
- 82022年职业院校技能大赛高职组云计算赛项试卷——云计算赛项第二场-容器云_2022 年全国职业院校技能大赛高职组云计算赛项试卷 【赛程名称】云计算赛项第二场
- 9函数式接口的妙用_函数式接口的作用
- 10安装谷歌服务框架2022最新版本22.45.15失败_谷歌框架
Codeforces Round #700 (Div. 2), problem: (B) The Great Hero,_a. game with board time limit per test2 seconds me
赞
踩
B. The Great Hero
time limit per test2 seconds
memory limit per test512 megabytes
inputstandard input
outputstandard output
The great hero guards the country where Homer lives. The hero has attack power A and initial health value B. There are n monsters in front of the hero. The i-th monster has attack power ai and initial health value bi.
The hero or a monster is said to be living, if his or its health value is positive (greater than or equal to 1); and he or it is said to be dead, if his or its health value is non-positive (less than or equal to 0).
In order to protect people in the country, the hero will fight with monsters until either the hero is dead or all the monsters are dead.
In each fight, the hero can select an arbitrary living monster and fight with it. Suppose the i-th monster is selected, and the health values of the hero and the i-th monster are x and y before the fight, respectively. After the fight, the health values of the hero and the i-th monster become x−ai and y−A, respectively.
Note that the hero can fight the same monster more than once.
For the safety of the people in the country, please tell them whether the great hero can kill all the monsters (even if the great hero himself is dead after killing the last monster).
Input
Each test contains multiple test cases. The first line contains t (1≤t≤105) — the number of test cases. Description of the test cases follows.
The first line of each test case contains three integers A (1≤A≤109), B (1≤B≤109) and n (1≤n≤105) — the attack power of the great hero, the initial health value of the great hero, and the number of monsters.
The second line of each test case contains n integers a1,a2,…,an (1≤ai≤109), where ai denotes the attack power of the i-th monster.
The third line of each test case contains n integers b1,b2,…,bn (1≤bi≤109), where bi denotes the initial health value of the i-th monster.
It is guaranteed that the sum of n over all test cases does not exceed 105.
Output
For each test case print the answer: “YES” (without quotes) if the great hero can kill all the monsters. Otherwise, print “NO” (without quotes).
