[dp问题] Girl Love Value（dp问题）hdu2670

Problem Description

    Love in college is a happy thing but always have so many pity boys or girls can not find it.Now a chance is coming for lots of single boys. The Most beautiful and lovely and intelligent girl in HDU,named Kiki want to choose K single boys to travel Jolmo Lungma. You may ask one girls and K boys is not a interesting thing to K boys. But you may not know Kiki have a lot of friends which all are beautiful girl!!!!. Now you must be sure how wonderful things it is if you be choose by Kiki.
    Problem is coming, n single boys want to go to travel with Kiki. But Kiki only choose K from them. Kiki every day will choose one single boy, so after K days the choosing will be end. Each boys have a Love value (Li) to Kiki, and also have a other value (Bi), if one boy can not be choose by Kiki his Love value will decrease Bi every day.
Kiki must choose K boys, so she want the total Love value maximum.

Input

The input contains multiple test cases.
First line give the integer n,K (1<=K<=n<=1000)
Second line give n integer Li (Li <= 100000).
Last line give n integer Bi.(Bi<=1000)

 

Output

Output only one integer about the maximum total Love value Kiki can get by choose K boys.

 

Sample Input

3 3
10 20 30
4 5 6
4 3
20 30 40 50
2 7 6 5

Sample Output

47
104

解析：首先根据bi的值从大到小排序，然后进行dp。dp[i][j]表示前i 个选择j个的最大值

dp[i][j]=max( dp[i-1][j] , dp[i-1][j-1]+第j个选择第i个的value )

#include<stdio.h>
#include<stdlib.h>
#include<string.h>
typedef struct da  
{
   int li;
   int bi;
}da;

da dd[1001];
int dp[1001][1001];

int cmp(const void *a,const void *b)
{
   da * c=(da *)a;
   da * d=(da *)b;
   return d->bi-c->bi;
}

int main()
{
	int i,j,n,k;
  while (scanf("%d%d",&n,&k)!=EOF)
  {
	  for(i=1;i<=n;i++)
		  scanf("%d",&dd[i].li);
	  for(i=1;i<=n;i++)
		  scanf("%d",&dd[i].bi);
	  qsort(dd+1,n,sizeof(dd[0]),cmp);
	  memset(dp,0,sizeof(dp));
	  for(i=1;i<=n;i++)
		  for(j=1;j<=i;j++)
		  {
			  if(i-1>=j) dp[i][j]=dp[i-1][j];
			  int temp=dp[i-1][j-1]-dd[i].bi*(j-1)+dd[i].li;
			  if(i-1>=j-1&&temp>dp[i][j])
				  dp[i][j]=temp;
		  }
	  printf("%d/n",dp[n][k]);
  }	
}

/*
3 3
10 20 30
4 5 6
4 3
20 30 40 50
2 7 6 5
*/