A10047 | Minimization
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
You've got array $A$ , consisting of $n$ integers and a positive integer $k$ . Array $A$ is indexed by integers from $1$ to $n$ .
You need to permute the array elements so that value
 became minimal possible. In particular, it is allowed not to change order of elements at all.
You need to permute the array elements so that value
 became minimal possible. In particular, it is allowed not to change order of elements at all.
输入格式
The first line contains two integers $n,k$ ( $2<=n<=3·10^{5}$ , $1<=k<=min(5000,n-1)$ ).
The second line contains $n$ integers $A[1],A[2],...,A[n]$ ( $-10^{9}<=A[i]<=10^{9}$ ), separate by spaces — elements of the array $A$ .
The second line contains $n$ integers $A[1],A[2],...,A[n]$ ( $-10^{9}<=A[i]<=10^{9}$ ), separate by spaces — elements of the array $A$ .
输出格式
Print the minimum possible value of the sum described in the statement.
输入输出样例
输入 #1
3 2 1 2 4
输出 #1
1
输入 #2
5 2 3 -5 3 -5 3
输出 #2
0
输入 #3
6 3 4 3 4 3 2 5
输出 #3
3
In the first test one of the optimal permutations is $1 4 2$ .
In the second test the initial order is optimal.
In the third test one of the optimal permutations is $2 3 4 4 3 5$ .
In the second test the initial order is optimal.
In the third test one of the optimal permutations is $2 3 4 4 3 5$ .
C++ 编辑器
输入
输出
可保存默认模板；新题优先使用已保存模板。
当前快捷键仅展示，暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好，我是作答助手。可以问思路、复杂度、样例含义或代码报错原因；不会直接给出完整 AC 代码。
确定要清空代码吗？
提交通过
评测结果：Accepted