用c++写一个01背包
时间: 2023-05-10 09:55:05 浏览: 54
Sure, here's an example code for solving the 01 knapsack problem in C:
```c
#include <stdio.h>
int max(int a, int b) {
return (a > b) ? a : b;
}
int knapsack(int W, int wt[], int val[], int n) {
int i, w;
int K[n+1][W+1];
for (i = 0; i <= n; i++) {
for (w = 0; w <= W; w++) {
if (i == 0 || w == 0)
K[i][w] = 0;
else if (wt[i-1] <= w)
K[i][w] = max(val[i-1] + K[i-1][w-wt[i-1]], K[i-1][w]);
else
K[i][w] = K[i-1][w];
}
}
return K[n][W];
}
int main() {
int val[] = {60, 100, 120};
int wt[] = {10, 20, 30};
int W = 50;
int n = sizeof(val)/sizeof(val[0]);
printf("Maximum value: %d", knapsack(W, wt, val, n));
return 0;
}
```
This code uses dynamic programming to solve the 01 knapsack problem, where we have a set of items each with a weight and a value, and we want to maximize the total value of items we can carry in a knapsack with a maximum weight capacity.