rt,本人蒟蒻只会这些

#include <bits/stdc++.h>
#define int unsigned long long
using namespace std;
int pd[10000010];
int a[10000010],d[10000010],minn = 92256821565646582,sum = 0;
signed main()
{
	int n,k;
	cin >> n >> k;
	for(int i = 1;i <= n;i ++)
	{
		cin >> a[i];
		d[i] = a[i] - a[i - 1];//差分
		pd[i] = d[i];
	}
	for(int i = 2;i <= n;i ++)
	{
		if(pd[i] <= minn && k != 0)
		{
			sum += pd[i];
			k--;
			i++;//处理相邻
		}
	}
	cout << sum;
	return 0;
}
```只拿了30分