LYD参与了一场俄罗斯竞赛，比赛中有n道题目，每道题目的分数会随时间以di的速度递减。他需要在T分钟内解决题目以获取最高分数。题目解决需要ci分钟。问题转化为如何按单位时间分数减少最快排序题目，以实现最大得分。输入包括题目数量、比赛时间、初始分数、分数减少率和解题时间。输出为LYD能获得的最大分数。
Problem Description
LYD loves codeforces since there are many Russian contests. In an contest lasting for T minutes there are n problems, and for the ith problem you can get ai−di∗ti points, where ai indicates the initial points, di indicates the points decreased per minute (count from the beginning of the contest), and tistands for the passed minutes when you solved the problem (count from the begining of the contest).
Now you kno
最低0.47元/天 解锁文章
扫一扫
1232
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
