【CodeForces - 1197C】Array Splitting（水题）

题干：

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

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

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

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

Input

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

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

Output

Print the minimum cost you can obtain by dividing the array aa into kk nonempty consecutive subarrays.

Examples

Input

6 3
4 8 15 16 23 42

Output

Input

4 4
1 3 3 7

Output

Input

8 1
1 1 2 3 5 8 13 21

Output

Note

In the first test we can divide array aa in the following way: [4,8,15,16],[23],[42][4,8,15,16],[23],[42].

题目大意：

给一个有序数组（n=3e5），分成K份，要求每份的最大值减最小值的差最小，求这个差值。

解题报告：

化简个公式然后求相邻点的差的最小值就可以了。取前k-1个，拿个优先队列维护一下。

AC代码：

#include<cstdio>
#include<iostream>
#include<algorithm>
#include<queue>
#include<map>
#include<vector>
#include<set>
#include<string>
#include<cmath>
#include<cstring>
#define F first
#define S second
#define ll long long
#define pb push_back
#define pm make_pair
using namespace std;
typedef pair<int,int> PII;
const int MAX = 4e5 + 5;
int a[MAX],n,k;
priority_queue<int> pq;
ll ans;
int main()
{cin>>n>>k;for(int i = 1; i<=n; i++) cin>>a[i];for(int i = 2; i<=n; i++) pq.push(a[i] - a[i-1]);for(int i = 1; i<=k-1; i++) ans -= pq.top(),pq.pop();ans += a[n]-a[1];cout << ans << endl;return 0 ;
}

【CodeForces - 1197C】Array Splitting（水题）相关推荐

codeforces 1060a（思维水题）
Let's call a string a phone number if it has length 11 and fits the pattern "8xxxxxxxxxx", ...
Codeforces Gym 100286I iSharp 水题
Problem I. iSharp Time Limit: 20 Sec Memory Limit: 256 MB 题目连接 http://acm.hust.edu.cn/vjudge/contest ...
Eugeny and Array（水题，注意题目描述即可）
Eugeny has array a = a1, a2, ..., an, consisting of n integers. Each integer ai equals to -1, or to ...
CodeForces - 1287B Hyperset(暴力水题)
题目链接:点击查看题目大意:给出"集合"的定义: 集合中必须有三个元素每个元素的每个特征值必须全部相同或者全部不同,不能存在两者相同但与第三者不同现在给出n个元素以及m个特征 ...
CodeForces 931C Laboratory Work 水题,构造
*这种题好像不用写题解... 题意: 一个人要改动别人的实验记录,实验记录记录是一个集合实验记录本身满足:$max(X)-min(X)<=2$ 改动结果要求: 1.新的集合平均值和之前的一样 ...
【CodeForces - 1066A~E】水题，模拟(有技巧)，思维，题意难懂的模拟，二进制问题(有技巧)
A. 题目大意: x坐标上1~L有L个点都是整数,每v个长度就有一个灯亮着,但是有 [ l , r ] 这段区间上有列火车挡住了,问你能看到多少亮灯. 解题报告: 大水题啊,找几个样例就会发现需要特殊 ...
【HDU 5532 Almost Sorted Array】水题，模拟
给出一个序列(长度>=2),问去掉一个元素后是否能成为单调不降序列或单调不增序列. 对任一序列,先假设其可改造为单调不降序列,若成立则输出YES,不成立再假设其可改造为单调不增序列,若成立则输出 ...
CodeForces - 13A Numbers【水题】
题目链接:https://codeforces.com/contest/13/problem/A 暴力 #include <iostream> using namespace std; i ...
CodeForces - 1042C （emmmmmm水题）
You are given an array aa consisting of nn integers. You can perform the following operations with i ...
Educational Codeforces Round 30 A[水题/数组排序]
A. Chores time limit per test 2 seconds memory limit per test 256 megabytes input standard input out ...

【CodeForces - 1197C】Array Splitting（水题）

【CodeForces - 1197C】Array Splitting（水题）相关推荐

最新文章

热门文章