C. Array Splitting(差分)

You are given a sorted array a1,a2,…,an (for each index i>1 condition ai≥ai−1 holds) and an integer k.

You are asked to divide this array into k non-empty consecutive subarrays. Every element in the array should be included in exactly one subarray.

Let max(i) be equal to the maximum in the i-th subarray, and min(i) be equal to the minimum in the i-th subarray. The cost of division is equal to ∑i=1k(max(i)−min(i)). For example, if a=[2,4,5,5,8,11,19] and we divide it into 3 subarrays in the following way: [2,4],[5,5],[8,11,19], then the cost of division is equal to (4−2)+(5−5)+(19−8)=13.

Calculate the minimum cost you can obtain by dividing the array a into k non-empty consecutive subarrays.

Input
The first line contains two integers n and k (1≤k≤n≤3⋅105).

The second line contains n integers a1,a2,…,an (1≤ai≤109, ai≥ai−1).

Output
Print the minimum cost you can obtain by dividing the array a into k nonempty consecutive subarrays.

Examples
input
6 3
4 8 15 16 23 42
output
12
input
4 4
1 3 3 7
output
0
input
8 1
1 1 2 3 5 8 13 21
output
20
Note
In the first test we can divide array a in the following way: [4,8,15,16],[23],[42].

题意：给出非严格递增的序列，再给出整数k，要求把序列分成k段，设每一段首尾值之差为每一段的cost，
求出采用使各段cost之和最小时的cost的总和。

根据要求的值的性质（前后相减所得），我们可以想到尝试差分数组，这里求差分时我们可以把第一个元素设为0，也就是当作它和自己做了一次差分。此时我们可以发现，假如不分段，那我们要求的cost就是整个差分数组之和，而每将数组分出一段，cost就减少一个值，该值恰恰为我们分段时划分的那条边界上的差分值，比如我们将1_n分为1j和j+1~n,那么cost的减少量就等于j+1处的原值（差分前的值）减去j处的原值，那么问题就转化成了如何减去最多的cost，这时候只要对差分数组sort排序，而后用数组总和减去前k-1大（众所周知，将一个数组分成k段只要划分k-1次）的元素和就可以得到答案。

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<vector>
using namespace std;
#define ll long long
const int maxn = 3e5+10;
int a[maxn];
int dis[maxn];
int cmp(int a,int b)
{
    return a>b;
}

int main()
{
    int n,k;
    cin>>n>>k;
    int i;
    for(i=1; i<=n; i++)
    {
        scanf("%d",&a[i]);
    }
    for(i=1; i<=n; i++)
    {
        if(i==1)
            dis[i] = 0;
        else
            dis[i] = a[i]-a[i-1];
    }
    int ans = a[n]-a[1];
    sort(dis+1,dis+1+n,cmp);
    for(i=1; i<k; i++)
    {
        ans -=dis[i];
    }
    cout<<ans<<endl;
    return 0;
}