1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
#include<stdio.h>
#include<string.h>
#include<iostream>
#define inf 99999999;
int a[1111],b[1111],dp[11][1111];
using namespace std;
int main()
{
   int n,m,k,t,i,s,j,cou,f,ans;
   scanf("%d",&s);
   while(s--){
    for(i=1;i<=11;i++)
        for(j=1;j<=1111;j++)
        dp[i][j]=inf;
      for(i=1;i<=11;i++)
        dp[i][0]=0;
    scanf("%d%d%d%d",&n,&m,&k,&t);
    for(i=1;i<=m;i++)
        scanf("%d",&a[i]);
    for(i=1;i<=m;i++)
        scanf("%d",&b[i]);
        for(f=1;f<=n;f++){
        for(i=0;i<=k;i++){
            for(int j=1;j<=m;j++){
                if(i-b[j]<0)
                continue;
                else
            dp[f][i]=min((dp[f][i-b[j]]+a[j]),dp[f][i]);
            }
        }
        cou=0;
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX