A13208. Bonus Distribution
编程题
普及/提高-
知识点
题目描述
The first line contains an integer $t$ ( $1 \le t \le 10^4$ ) — the number of test cases in the input. Then $t$ test cases follow.
The first line of each test case contains two integers $n$ and $k$ ( $1 \le n \le 10^5$ , $1 \le k \le 10^9$ ) — the number of employees and the total bonus.
The second line of each test case contains $n$ different integers $a_1, a_2, \dots, a_n$ ( $1 \le a_i \le 10^9$ ), where $a_i$ is the current salary of the $i$ -th employee.
It is guaranteed that the sum of all $n$ values in the input does not exceed $10^5$ .
The first line of each test case contains two integers $n$ and $k$ ( $1 \le n \le 10^5$ , $1 \le k \le 10^9$ ) — the number of employees and the total bonus.
The second line of each test case contains $n$ different integers $a_1, a_2, \dots, a_n$ ( $1 \le a_i \le 10^9$ ), where $a_i$ is the current salary of the $i$ -th employee.
It is guaranteed that the sum of all $n$ values in the input does not exceed $10^5$ .
输入格式
Print the answers to $t$ test cases in the order they appear in the input. Print each answer as a sequence of non-negative integers $d_1, d_2, \dots, d_n$ . If there are several answers, print any of them.
输出格式
无
输入输出样例
输入 #1
5 4 1 3 1 4 2 2 3 10 2 4 1000000000 987654321 1000000000 999999999 500000000 8 9 5 6 1 8 3 4 2 7 6 1 6 3 1 8 5 9
输出 #1
0 0 1 0 0 3 134259259 121913582 121913582 621913577 2 2 0 2 0 1 0 2 1 0 0 0 0 0