PAT 甲级 1033 Fill or Not to Fill (25分)

PAT 甲级 1033 Fill or Not to Fill (25分)

题目

With highways available, driving a car from Hangzhou to any other city is easy. But since the tank capacity of a car is limited, we have to find gas stations on the way from time to time. Different gas station may give different price. You are asked to carefully design the cheapest route to go.

Input Specification:

Each input file contains one test case. For each case, the first line contains 4 positive numbers:$C_{max}$ (≤ 100), the maximum capacity of the tank; D (≤30000), the distance between Hangzhou and the destination city; $D_{avg}$ (≤20), the average distance per unit gas that the car can run; and N (≤ 500), the total number of gas stations. Then N lines follow, each contains a pair of non-negative numbers: $P_i$, the unit gas price, and D i D_i