01背包问题个人想法代码（部分数据结果不准确）

#include<stdio.h>
struct Nature
{
	int v;
	int w;
	int s;
};

void bubblesort(Nature a[], int n)
{
	Nature temp;
	for (int j = n - 1; j > 0; j--)//控制比较的最右端下标
		for (int i = 0; i < j; i++)//执行冒泡比较
		{
			if ((double)(a[i].w/a[i].v) <(double)( a[i + 1].w/a[i+1].v))//将性价比最高的排在前头
			{
				temp.v = a[i].v;
				temp.w = a[i].w;
				temp.s = a[i].s;
				a[i].v = a[i + 1].v;
				a[i].w = a[i + 1].w;
				a[i].s = a[i + 1].s;
				a[i + 1].v = temp.v;
				a[i + 1].w = temp.w;
				a[i + 1].s = temp.s;
			}
		}
}

int main()
{
	int N, V;
	scanf_s("%d %d", &N, &V);
	Nature a[1000];
	for (int i = 0; i < N; i++)
		scanf_s("%d %d %d", &a[i].v, &a[i].w, &a[i].s);
	bubblesort(a, N);
	int sum = 0,r=0,t=0,vue=0;
	int b[10000],c[10000];
	for(int i=0;i<N;i++)//将价值和体积拆分到两个数组
		for (int j = 0; j < a[i].s; j++)
		{
			b[r] = a[i].v;
			c[r] = a[i].w;
			r++;
		}

	for (int i = 0; i < r; i++)//对体积数组进行相加判断是否超过最大容量，若不超过进行体积和价值的累加
	{
		if (sum + b[i] <= V)
		{
			sum = sum + b[i];
			vue = vue + c[i];
		}
	}
	printf("%d", vue);
}



![在这里插入图片描述](https://img-blog.csdnimg.cn/1c41fbccef1945338cdfc9f39e8cfd7b.png?x-oss-process=image/watermark,type_ZHJvaWRzYW5zZmFsbGJhY2s,shadow_50,text_Q1NETiBAcXFfNTM0Mzk0NzQ=,size_20,color_FFFFFF,t_70,g_se,x_16)

题目来源 https://www.acwing.com/problem/content/4/