问题C：搬寝室

第一次想着递归实现，果不其然地在oj上超时了

#include<iostream>
#include<algorithm>
using namespace std;

int wt[25000];
long long ans(int n, int x)//x=2 to the kth power
{
	if (x == 2)
	{
		int t1, t2,sum,min=(wt[2]-wt[1])* (wt[2] - wt[1]);
		for (int i = 1; i <= n-1; i++)
		{
			t1 = wt[i + 1] - wt[i];
			t1 *= t1;
			if (t1 < min) min = t1;
		}
		return min;
	}
	if (n == x)
	{
		long long sum = 0,t2=0;
		for (int i = 1; i <= (n / 2); i++)
		{
			t2 = wt[2 * i] - wt[2 * i - 1];
			t2 *= t2;
			sum += t2;
		}
		return sum;
	}
	else
	{
		int t3 = wt[n] - wt[n - 1];
		t3 *= t3;
		long long temp1 = ans(n - 2, x - 2) + t3,temp2=ans(n-1,x);
		if (temp1 < temp2) return temp1;
		else return temp2;
		
	}
}
bool cmp(int x, int y)
{
	return (x < y);
}
int main()
{
	int n = 0, k = 0;
	while (cin>>n>>k)
	{
		for (int i = 1; i <= n; i++) cin >> wt[i];
		sort(wt+1, wt + n+1, cmp);
		int numofgoods = 2*k;
		long long ans1 = ans(n,numofgoods);
		cout << ans1 << endl;
	}
}

好叭，再来一次

#include<iostream>
#include<algorithm>
using namespace std;

long long ans[2010][2010];
long long wt[2010];//重量
bool cmp(int x, int y)
{
	return (x < y);
}
long long min(int x, int y)
{
	if (x < y) return x;
	else return y;
}

int main()
{
	int n = 0, k = 0;
	while (cin>>n>>k)
	{
		for (int i = 1; i <= n; i++) cin >> wt[i];
		int numofgoods = 2*k;
		sort(wt + 1, wt + n + 1, cmp);
		for (int i = 2; i <= n; i++)
		{
			int min = wt[2] - wt[1];
			min *= min;
			for (int j = 1; j < i; j++)
			{
				int temp = wt[j + 1] - wt[j];
				temp *= temp;
				if (temp < min) min = temp;
			}
			ans[i][2] = min;
		}
		for (int i = 4; i <= n; i++)
		{
			for (int j = 4; j <= numofgoods; j++)
			{
				if (i != j)
				{
					int temp2 = wt[i] - wt[i - 1];
					temp2 *= temp2;
					ans[i][j] = min(ans[i - 1][j], ans[i - 2][j - 2] + temp2);
				}
				else
				{
					int sum = 0;
					for (int k = 1; k <= i/2; k++)
					{
						int temp3 = wt[2 * k] - wt[2 * k - 1];
						temp3 *= temp3;
						sum += temp3;
					}
					ans[i][j] = sum;
				}
			}
		}
		cout << ans[n][numofgoods] << endl;
	}
}

#include<iostream>
using namespace std;

struct bone
{
	int value = 0;
	int volume = 0;
}arr[1010];
int ans[1010];
int max(int x, int y);
int main()
{
	int T = 0, N = 0, V = 0, t = 0;
	cin >> T;
	for (int i = 0; i < T; i++)
	{
		for (int i = 1; i <= N; i++)
		{
			arr[i].value = 0;
			arr[i].volume = 0;
		}

		cin >> N >> V;

		for (int j = 0; j <= V; j++)
		{
			ans[j] = 0;
		}


		for (int i = 1; i <= N; i++) cin >> arr[i].value;
		for (int i = 1; i <= N; i++) cin >> arr[i].volume;
		for (int i = 1; i <= N; i++)
		{
			for (int j = V; j >= arr[i].volume; j--)
			{
				if (j - arr[i].volume < 0) t = 0;
				else t = ans[j - arr[i].volume] + arr[i].value;
				ans[j] = max( ans[j],t );
			}
		}

		

		cout << ans[V] << endl;
	}

}

int max(int x, int y)
{
	if (x > y) return x;
	else return y;
}

主要是留给自己以后看的hh，可读性比较低请见谅