CF1297D.Bonus Distribution

普及/提高-

通过率:0%

AC君温馨提醒

该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。

题目描述

The first line contains an integer tt ( 1t1041 \le t \le 10^4 ) — the number of test cases in the input. Then tt test cases follow.

The first line of each test case contains two integers nn and kk ( 1n1051 \le n \le 10^5 , 1k1091 \le k \le 10^9 ) — the number of employees and the total bonus.

The second line of each test case contains nn different integers a1,a2,,ana_1, a_2, \dots, a_n ( 1ai1091 \le a_i \le 10^9 ), where aia_i is the current salary of the ii -th employee.

It is guaranteed that the sum of all nn values in the input does not exceed 10510^5 .

输入格式

Print the answers to tt test cases in the order they appear in the input. Print each answer as a sequence of non-negative integers d1,d2,,dnd_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
首页