#BZOJ3945. 无聊的邮递员
-
ID: 2515
Type: RemoteJudge
1000ms
256MiB
Tried: 0
Accepted: 0
Difficulty: (None)
Uploaded By:
root
无聊的邮递员
No submission language available for this problem.
题目描述
输入格式
第一行两个整数n, k，意义如问题描述。
接下来n行，每行一个整数x_i。
输出格式
一行一个整数，表示第k小的方案的路径总长度。数据保证至少存在k个方案。
5 11
1
-1
2
-2
3
11
数据范围与约定
N<=10000,K<=500000,|X_i|<=100000000