题解 | MOE Top‑k 路由

n, m, p, k = input().split(" ")
n = int(n)
m = int(m)
p = int(p)
k = int(k)

a = [0.0] * n

line2 = input().split(" ")
for i in range(n):
    a[i] = float(line2[i])

if n % m != 0:
    print("error")
elif p > m:
    print("error")
else:
    g = int(n / m)
    if p * g < k:
        print("error")
    else:
        max = [0.0] * m
        for i in range(m):
            for j in range(g):
                index = int(i * g + j)
                if a[index] > max[i]:
                    max[i] = a[index]

        groups = []

        # 找出前p个组
        while(len(groups) != p):
            t = 0
            for i in range(len(max)):
                if max[i] > max[t]:
                    t = i
            groups.append(t)
            max[t] = 0

        final = []
        idx = []
        for i in groups:
            for j in range(g):
                final.append(a[i*g+j])
                idx.append(i*g+j)

        output = []
        for _ in range(k):
            temp = final[0]
            t = 0
            for i in range(len(final)):
                if final[i] > temp:
                    temp = final[i]
                    t = i
            output.append(idx[t])
            # print(idx[t], end=" ")
            final[t] = 0
        
        # 升序输出
        output.sort()
        for i in output:
            print(i, end=' ')