[传智杯 #5 初赛] D-莲子的物理热力学

题目链接

P8872 [传智杯 #5 初赛] D-莲子的物理热力学 - 洛谷 | 计算机科学教育新生态 (luogu.com.cn)

#include <iostream>
#include <algorithm>
#include <cstring>

using namespace std;

const int N = 1e5 + 10;

int a[N], dp[N];
int n, m;

int main()
{
	cin >> n >> m;
	for (int i = 0; i < n; i++) cin >> a[i];

	if (m >= n - 1)
	{
		cout << 0 << endl;
		return 0;
	}
	sort(a, a + n);

	dp[0] = a[n - 1 - m] - a[0];
	for (int i = 1; i <= m; i++)
	{
		if (m - 2 * i >= 0)
			dp[i] = min(dp[i - 1], a[n - 1 + i - (m - i)] - a[i]);
		else
			dp[i] = min(dp[i - 1], a[n - 1] - a[i]);
	}
	int res = dp[m];
	memset(dp, 0, sizeof dp);

	dp[n - 1] = a[n - 1] - a[m];
	for (int i = n - 2; i >= n - 1 - m; i--)
	{
		if (m - 2 * (n - 1 - i) >= 0)
			dp[i] = min(dp[i + 1], a[i] - a[m - 2 * (n - 1 - i)]);

		else
			dp[i] = min(dp[i + 1], a[i] - a[0]);
	}
	res = min(res, dp[n - 1 - m]);

	cout << res << endl;

	return 0;
}