说明：  设在一个区域中有n个垃圾桶，编号分别为1，2，…, n，每个垃圾桶的重量对应为w1，w2, …, wn。垃圾填埋场在A点，垃圾车初始时在B点。试规划垃圾车的行车路径，要求将所有垃圾桶内的垃圾都运送至垃圾填埋场A。
(In one area, there are n trash cans, numbered 1, 2, respectively. N, the weight of each trash can correspond to W1, W2,... Wn. At the A point, the garbage truck starts at B point. Try to plan the driving path of the garbage truck, and request all rubbish in the trash can be delivered to the landfill A. Basic requirements:)