山东省第八届ACM省赛 K 题 CF 解答(未完,待续)
2017-08-17 15:30
525 查看
CF
Time Limit: 1000MSMemory Limit: 65536KB
Problem Description
![](http://acm.sdut.edu.cn/image/3903.png)
LYD loves codeforces since there are many Russian contests. In an contest lasting forT minutes there are
n problems, and for the ith problem you can getai−di∗ti points, where
ai indicates the initial points,di indicates the points decreased per minute (count from the beginning of the contest), andti stands for the passed minutes when you solved the problem (count from the begining of the contest).
Now you know LYD can solve the ith problem in ci minutes. He can't perform as a multi-core processor, so he can think of only one problem at a moment. Can you help him get as many points as he can?
Input
The first line contains two integers n,T(0≤n≤2000,0≤T≤5000).The second line contains n integers a1,a2,..,an(0<ai≤6000).
The third line contains n integers d1,d2,..,dn(0<di≤50).
The forth line contains n integers c1,c2,..,cn(0<ci≤400).
Output
Output an integer in a single line, indicating the maximum points LYD can get.Example Input
3 10 100 200 250 5 6 7 2 4 10
Example Output
254
相关文章推荐
- 山东省第八届ACM省赛 K 题(CF)
- 山东省第八届ACM省赛 K 题 CF (排序01背包)
- 山东省第八届ACM省赛 G 题 sum of power 解答
- 山东省第八届acm省赛D题 HEX
- 山东省第八届ACM省赛 I 题 Parity check 详解
- 山东省第八届acm省赛 Return of the Nim
- SDUT 3895 (山东省第八届ACM省赛C题) fireworks 杨辉三角+乘法逆元
- 山东省第八届acm省赛D题HEX(组合数学)
- 山东省第八届acm省赛C题 巨坑
- 山东省第八届acm省赛 company
- 山东省第八届ACM省赛 Problem.H triangle
- 山东省第八届acm省赛B题 打表找规律
- 山东省第八届ACM省赛A.Return of the Nim
- [置顶] 2017年山东省第八届acm省赛总结
- 山东省第八届ACM省赛C firework
- 山东生第八届acm省赛 cf
- 山东省第八届acm省赛E题 三分+二分
- "浪潮杯”山东省第八届ACM大学生程序设计竞赛 CF
- CF----思维排序+01背包 山东省第八届省赛K题
- 山东省第八届ACM省赛 D.HEX