Tape CodeForces - 1110B 贪心

You have a long stick, consisting of mm segments enumerated from 11 to mm. Each segment is 11 centimeter long. Sadly, some segments are broken and need to be repaired.

You have an infinitely long repair tape. You want to cut some pieces from the tape and use them to cover all of the broken segments. To be precise, a piece of tape of integer length tt placed at some position ss will cover segments s,s+1,…,s+t−1s,s+1,…,s+t−1.

You are allowed to cover non-broken segments; it is also possible that some pieces of tape will overlap.

Time is money, so you want to cut at most kk continuous pieces of tape to cover all the broken segments. What is the minimum total length of these pieces?

Input

The first line contains three integers nn, mm and kk (1≤n≤1051≤n≤105, n≤m≤109n≤m≤109, 1≤k≤n1≤k≤n) — the number of broken segments, the length of the stick and the maximum number of pieces you can use.

The second line contains nn integers b1,b2,…,bnb1,b2,…,bn (1≤bi≤m1≤bi≤m) — the positions of the broken segments. These integers are given in increasing order, that is, b1<b2<…<bnb1<b2<…<bn.

Output

Print the minimum total length of the pieces.

Examples

Input

4 100 2
20 30 75 80

Output

17

Input

5 100 3
1 2 4 60 87

Output

6

Note

In the first example, you can use a piece of length 1111 to cover the broken segments 2020 and 3030, and another piece of length 66 to cover 7575 and 8080, for a total length of 1717.

In the second example, you can use a piece of length 44 to cover broken segments 11, 22and 44, and two pieces of length 11 to cover broken segments 6060 and 8787.

首先算出间距存在d里

然后对d排序 用完整长度再减去其中k-1个最大的

为啥要减k-1呢？ 我们不是有k个可用嘛？

因为一开始的完整长度是用了一次贴好的 所以就仅剩下k-1个了 

其实就是换个角度思考

#include<bits/stdc++.h>
using namespace std;

const int maxn=1e5+1003;

int a[maxn],d[maxn];

int main()
{
	int n,m,k;
	scanf("%d%d%d",&n,&m,&k);
	for(int i=1;i<=n;i++) scanf("%d",&a[i]);
	for(int i=1;i<n;i++) d[i]=a[i+1]-a[i];
	int minn=a[n]-a[1]+1;
	//cout<<d[n-1]<<endl;
	sort(d+1,d+n);
	//cout<<d[n-1]<<endl;
	int p=n-1;
	k-=1;
	while(k--)
	{
		minn-=(d[p--]-1);
	}	
	printf("%d\n",minn);
}