Educational Codeforces Round 66 D Array Splitting

传送门
You are given an array a1,a2,…,an 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 f(i) be the index of subarray the i-th element belongs to. Subarrays are numbered from left to right and from 1 to k.

Let the cost of division be equal to ∑i=1n(ai⋅f(i)). For example, if a=[1,−2,−3,4,−5,6,−7] and we divide it into 3 subbarays in the following way: [1,−2,−3],[4,−5],[6,−7], then the cost of division is equal to 1⋅1−2⋅1−3⋅1+4⋅2−5⋅2+6⋅3−7⋅3=−9.

Calculate the maximum 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 (|ai|≤106).

---

Output

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

---

为什么每次做cf的题总会被爆智商……
看成后缀的和，然后贪心

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MAXN = 300005;
int n,k,data[MAXN];
ll suf[MAXN];
int main(){
	scanf("%d%d",&n,&k);
	for(int i=1;i<=n;i++)scanf("%d",&data[i]);
	for(int i=n;i>=1;i--)
		suf[i]=data[i]+suf[i+1];
	sort(suf+2,suf+1+n,greater<ll>());
	ll ans = 0;
	for(int i=1;i<=k;i++)
		ans += suf[i];
	cout<<ans;
	return 0;
}