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>
#include<algorithm>
using namespace std;
typedef long long ll;
const int N = 1e4 +5;
int n,m,k,t,A[105],B[105];
ll dp[N];
int main(void){
    int i,j,T;
    scanf("%d",&T);
    while(T--){
        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]);
            
        ll ans=0; bool ok=1;
        for(i=1;i<=n;i++){
            memset(dp,0x3f,sizeof(dp));
            dp[0]=0;
            ll temp=(ll)0x3f3f3f3f3f3f3f3f;
            
            for(j=1;j<=m;j++)
                for(int l=0;l<=k;l++)
                    if(B[j]+l>k) temp=min(temp,dp[l]+A[j]);
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX