HDU 4526 威威猫系列故事——拼车记(01背包)

const int inf = 1<<30;
int T[102],Z[102], dp[102][102];
int main()
{
int T;
cin >> T;
while(T--)
{
int k , n , d , s, i , j , z, t , q;
cin >> n >> k >> d >> s;
for(i = 0;i <= n;i++)
for(j = 0;j <= k;j++)
dp[i][j] = inf;
dp[0][0] = 0;
for(i = 1;i <= k;i++)
{
cin >> t >> z;
for(j = 0;j <= n;j++)
{
dp[i][j] = dp[i - 1][j];
for(q = 1;q <= z;q++)
{
if(j < q) break;
dp[i][j] = min(dp[i][j] , dp[i - 1][j - q] + q*t + d);
}
}
}
if(dp[k]
== inf) puts("impossible");
else
printf("%d\n",dp[k]
);
}
return 0;
}