Given two arrays representing an elevator problem, one array represents the weight of each person, and the second one represents the floor they are looking to reach.\n\nFor example:\n[60, 20, 80, 180, 60]\nand\n[2, 2, 3, 3, 5]\n\nThe maximum weight the elevator can carry is 200.\n\nQuestion: what\'s the least amount of distance the elevator has to travel? (From floor 1 to floor 2, distance will be 2-1=1)\n\nAssume everyone starts on the first floor, and the elevator has to come back to the first floor to p ick up every group.\n\nAssume people cannot skip the line. ie. 60 and 20 have to go before 80.\n\nThis part is relatively simple. Because I can\'t skip the line, just do a linear scan.\n\nFollow up is much more difficult: what if people can skip the line? I wasn\'t sure how to solve it. Maybe with backtracking or DP?

Given two arrays representing an elevator problem, one array represents the weight of each person, and the second one represents the floor they are looking to r