HDU 2660 Accepted Necklace

#include <stdio.h>
const int INF=10000000;
int f[25][1010];
int a[25],b[25];
int main()
{
int T;
scanf("%d",&T);
int n,k,w,i,j,j1,j2;
while (T--)
{
scanf("%d%d",&n,&k);
for (i=1;i<=n;i++) scanf("%d%d",&a[i],&b[i]);
scanf("%d",&w);
for (i=1;i<=k;i++) for (j=0;j<=w;j++) f[i][j]=-INF;
for (j=0;j<=w;j++) f[0][j]=0;
for (i=1;i<=n;i++)
for (j1=k;j1>=1;j1--)
for (j2=w;j2>=b[i];j2--)
if(f[j1][j2]<f[j1-1][j2-b[i]]+a[i])
f[j1][j2]=f[j1-1][j2-b[i]]+a[i];
printf("%d\n",f[k][w]);
}
return 0;
}