Company: Adobe_11july
Difficulty: medium
Optimal Pickup Station Problem Description ByteCity is a bustling metropolis where office workers thrive on food delivery services. The city's main commercial hub, Tech Avenue, is a straight road lined with N office buildings, each housing employees who rely on quick and efficient lunch deliveries. The first building is at the start of the avenue (0 meters), and each subsequent building stands 100 meters further down the road, so the i-th building (1-indexed) is at (i-1) * 100 meters. The i-th building has p_i employees who order lunch daily. For years, ByteEats has dominated the food delivery market with strategically placed pickup stations. There are M existing ByteEats pickup stations, each at a unique position x_j meters along the avenue. Some of these stations may even coincide with office buildings, making it difficult for competitors to attract customers. Now, a new challenger, FastLunch, has entered the market, determined to disrupt ByteEats' monopoly. Your job, as FastLunch's