2018组队训练赛第二十二场--省赛前最后一水.CF

问题 K: CF

时间限制: 1 Sec   内存限制: 128 MB
提交: 117   解决: 25
[ 提交][ 状态][ 讨论版][命题人: 外部导入]

题目描述

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 ti 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?

输入

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 an integer in a single line, indicating the maximum points LYD can get.

样例输入

3 10
100 200 250
5 6 7
2 4 10

样例输出

254

考点：贪心+动态规划

#include<bits/stdc++.h>
using namespace std;
struct node{
    int a,b,c;
    double f;
}x[2009];
int dp[5009];
bool cmp(struct node a,struct node b){
    return a.f>b.f;
}
int main(){
    int n,t;
    cin>>n>>t;
    memset(dp,0,sizeof(dp));
    for(int i=1;i<=n;i++)  cin>>x[i].a;
    for(int i=1;i<=n;i++)  cin>>x[i].b;
    for(int i=1;i<=n;i++)  cin>>x[i].c;
    for(int i=1;i<=n;i++)
        x[i].f=1.0*x[i].b/x[i].c;
    sort(x+1,x+n+1,cmp);
    int mix=0;
    for(int i=1;i<=n;i++){
        for(int j=t;j>=x[i].c;j--){
            dp[j]=max(dp[j],dp[j-x[i].c]+x[i].a-x[i].b*j);
            mix=max(dp[j],mix);
        }
    }
    cout<<mix<<endl;;
    return 0;
}