zoj 3211

#include<iostream>#include<stdio.h>#include<algorithm>#include<cstring>using namespace std;struct Node{int ai,bi;}tree[260];bool cmp(Node a, Node b){if(a.bi==b.bi) return a.ai>b.ai;return a.bi<b.bi;}int Max(int a,int b){if(a>b) return a;else return b;}int main(){int t,n,m,i,j;scanf("%d",&t);while(t--){int dp[255][255];memset(dp,0,sizeof(dp));scanf("%d%d",&n,&m);{for(i=1;i<=n;i++){scanf("%d",&tree[i].ai);}for(i=1;i<=n;i++){scanf("%d",&tree[i].bi);}sort(tree+1,tree+n+1,cmp);if(m>n) m=n;for(i=1;i<=n;i++)//{for(j=1;j<=m;j++){dp[i][j]=Max(dp[i-1][j],dp[i-1][j-1]+tree[i].ai+tree[i].bi*(j-1));}}printf("%d\n",dp[n][m]);}}return 0;}

•