Codeforces Global Round 14 c

C. Phoenix and Towers
time limit per test2 seconds
memory limit per test256 megabytes
inputstandard input
outputstandard output
Phoenix has n blocks of height h1,h2,…,hn, and all hi don’t exceed some value x. He plans to stack all n blocks into m separate towers. The height of a tower is simply the sum of the heights of its blocks. For the towers to look beautiful, no two towers may have a height difference of strictly more than x.

Please help Phoenix build m towers that look beautiful. Each tower must have at least one block and all blocks must be used.

Input
The input consists of multiple test cases. The first line contains an integer t (1≤t≤1000) — the number of test cases.

The first line of each test case contains three integers n, m, and x (1≤m≤n≤105; 1≤x≤104) — the number of blocks, the number of towers to build, and the maximum acceptable height difference of any two towers, respectively.

The second line of each test case contains n space-separated integers (1≤hi≤x) — the heights of the blocks.

It is guaranteed that the sum of n over all the test cases will not exceed 105.

Output
For each test case, if Phoenix cannot build m towers that look beautiful, print NO. Otherwise, print YES, followed by n integers y1,y2,…,yn, where yi (1≤yi≤m) is the index of the tower that the i-th block is placed in.

If there are multiple solutions, print any of them.

Example
inputCopy
2
5 2 3
1 2 3 1 2
4 3 3
1 1 2 3
outputCopy
YES
1 1 1 2 2
YES
1 2 2 3
Note
In the first test case, the first tower has height 1+2+3=6 and the second tower has height 1+2=3. Their difference is 6−3=3 which doesn’t exceed x=3, so the towers are beautiful.

In the second test case, the first tower has height 1, the second tower has height 1+2=3, and the third tower has height 3. The maximum height difference of any two towers is 3−1=2 which doesn’t exceed x=3, so the towers are beautiful.

题意：
n个有重量的物体
按照一定的方法放进m个桶里
使得最重的桶-最轻的桶不超x
重量为桶内物体的和

• 这么来想的话
• 升序排好 依次放入 因为每一个物体都小于x 那么每一次 最重的那一个减去最小的
• 肯定是小于x的 第一轮循环后 第二轮 最轻的加了一个比刚才一轮最重的还要更大的一个物体
• 所以这时 当上一轮最重的桶再新增一个物体的时间 差值依然小于x

所以 我们按照他们的重量 把他们的序号排好 然后就可以依次放入了

def read():
    number=eval(input())
    return number
def gets():
    s=input()
    return s
def cout(x):
    print(x)
def main():
    T=eval(input())
    while T:
        T=T-1
        n,m,x=map(int,input().split())
        k=list(map(int,input().split()))
        dj=sorted(range(n),key=lambda i:k[i])
        ans=[0]*n
        cnt=0
        for i in dj:
            ans[i]=cnt+1    
            cnt=(cnt+1)%m
        cout("YES")
        print(*ans)
main()