C - Sweets Eating CodeForces - 1253C

Tsumugi brought n
delicious sweets to the Light Music Club. They are numbered from 1 to n, where the i-th sweet has a sugar concentration described by an integer ai

.

Yui loves sweets, but she can eat at most m

sweets each day for health reasons.

Days are 1
-indexed (numbered 1,2,3,…). Eating the sweet i at the d-th day will cause a sugar penalty of (d⋅ai)

, as sweets become more sugary with time. A sweet can be eaten at most once.

The total sugar penalty will be the sum of the individual penalties of each sweet eaten.

Suppose that Yui chooses exactly k

sweets, and eats them in any order she wants. What is the minimum total sugar penalty she can get?

Since Yui is an undecided girl, she wants you to answer this question for every value of k
between 1 and n

Input
The first line contains two integers n
and m (1≤m≤n≤200 000).

The second line contains n
integers a1,a2,…,an (1≤ai≤200 000 ).
Output
You have to output n
integers x1,x2,…,xn on a single line, separed by spaces, where xk is the minimum total sugar penalty Yui can get if she eats exactly k sweets.
Examples
Input

9 2
6 19 3 4 4 2 6 7 8

Output

2 5 11 18 30 43 62 83 121

Input

1 1
7

Output

7

Note
Let’s analyze the answer for k=5
in the first example. Here is one of the possible ways to eat 5

sweets that minimize total sugar penalty:
Day 1: sweets 1 and 4
Day 2: sweets 5 and 3
Day 3: sweet 6

Total penalty is 1⋅a1+1⋅a4+2⋅a5+2⋅a3+3⋅a6=6+4+8+6+6=30
. We can prove that it’s the minimum total sugar penalty Yui can achieve if she eats 5 sweets, hence x5=30
其实就是一个规律题：你把题目样例给的数据自己手动写一下就会发现规律。
首先得想到贪心思维，要使得k*a[i]最小，数值小的最后吃，数值大的最先吃。
你定义两个数组，一个ans[],一个前缀和sum[],
接下来看样例你会发现：
$i<=m时,ans[i]=sum[i]$
$i>m时,ans[i]=ans[i-m]+sum[i]$

代码如下：

#include<iostream>
#include<algorithm>
using namespace std;
typedef long long ll;
const int N=200010;
int a[N];
ll sum[N],ans[N];
int main(){
	int n,m,i,t,j;
	cin>>n>>m;
	for( i=1;i<=n;i++){
		scanf("%d",&a[i]);
	}
	sort(a+1,a+n+1);
	sum[0]=0;
	for(i=1;i<=n;i++){
		sum[i]=sum[i-1]+a[i];
	}
	for(i=1;i<=n;i++){
		if(i<=m)ans[i]=sum[i];
		else ans[i]=ans[i-m]+sum[i];
	}
	for(i=1;i<=n;i++){
		cout<<ans[i]<<' ';
	}
	return 0;
}