长乐集训 Day 1

• 摸鱼

A. 国际象棋

• 大水题

#include 
using namespace std;
int n, k;
long long a[100001], b[100001];
long long sum;
int main() {
    freopen("chess.in", "r", stdin);
    freopen("chess.out", "w", stdout);
    cin >> n >> k;
    for (int i = 1; i > a[i];
    sort(a + 1, a + n + 1);
    for (int i = 1; i < n; i++) b[i] = a[i + 1] - a[i];
    sort(b + 1, b + n);
    for (int i = 1; i <= k; i++) sum += b[i];
    cout << sum;
    return 0;
}