RT，有人思路和我一样然后过了，但是我错了 9 个点

思路大概就是排序，然后找和最大的合法连续段，用总和减掉。

求各路神仙帮忙康康 /kel

#include <bits/stdc++.h>
using namespace std;
#define int long long
int n, m, a[200010], b[200010], c[200010];
long long sum1, sum2;
signed main() {
	cin >> n >> m;
	for (int i = 1; i <= n; ++ i) scanf("%lld", &a[i]), b[i] = a[i], sum1 += a[i];
	sort(b + 1, b + n + 1);
	c[1] = 1;
	for (int i = 2; i <= n; ++i)
		if (b[i] == b[i - 1] || b[i] == b[i - 1] + 1) c[i] = 1;
	int l = 1, r = 1;
	long long res = b[l], cnt = 0;
	for (int i = 2; i <= n; ++i) {
		if (c[i]) ++r, res += b[i];
		else cnt = max(res, cnt), l = i, r = i, res = b[l];
	//	cout << res << " " << cnt << endl;
	}
	cnt = max(res, cnt);
	l = 1, r = 1, res = 0;
	for (int i = 2; i <= n; ++i) {
		if (c[i]) ++r, res += b[i];
		else if (res == cnt) break;
		else l = i, r = i, res = b[l];
	}
	for (int i = l; i <= r; ++i) sum2 += b[i];
//	for (int i = 1; i <= n; ++i) cout << b[i] << " ";
//	puts("");
//	cout << l << " " << r << endl;
	cout << sum1 - sum2;
	return 0;
}