使用Python先排序再直接暴力搜索即可 def fin(a, h): i = 0 if h == 0: return True while i < len(a) and a[i] <= h: tmp = a[i] a.pop(i) if fin(a, h - tmp): return True a[i:i] = [tmp] i += 1 return False a = input().split(' ') sum = 0 f...