最优装载问题（python）

while True:
    try:
        n, c = list(map(int, input().split()))
        a = []
        for i in range(n):
            d = list(map(int, input().split()))
            a.append(d)
        sorted_a = sorted(a, key=lambda x: x[1])
        weight = 0
        num = 0
        s = []
        for i in range(n):
            if weight + sorted_a[i][1] <= c:
                weight += sorted_a[i][1]
                num += 1
                s.append(i)
        print(num)
        s_2 = []
        for index in s:
            s_2.append(sorted_a[index][0])
        print(*s_2)
    except EOFError:
        break

1.排序：按物体的轻重顺序，由轻到重排列

2.贪心选择 ：只要满足weight + sorted_a[i][1] <= c，即装得下

3.拓展函数：sorted_a = sorted(a, key=lambda x: x[1])