|시간 제한||메모리 제한||제출||정답||맞은 사람||정답 비율|
|1 초||128 MB||1||1||1||100.000%|
Air Old Zeeland, or as it is informally known, Air OZ has taken to allowing customers to redeem their loyalty points for products. As it is only a recent idea, Air OZ is testing the market by offering a small but select number of products. Unfortunately the suppliers are not very good at keeping up with the demand and Air OZ decided to record the number of days a customer would have to wait for each product along with its listed price. This will enable them to get a feel for how many discontented customers they have
Input will consist of a number of scenarios. The first line of each scenario contains a number N (0 < N <= 50) which represents the number of products in this offering. End of input is marked by a scenario with 0 products – this line should not be processed.
The product count is followed by N lines with each of Air OZ’s products listed on its own line. Each product name, which is limited to 20 characters and with no embedded spaces, is followed by the number of loyalty points needed to acquire the reward and the days to wait for it to be shipped to the purchaser. Each of these fields is separated by a single space. No product costs more than 1000 loyalty points and no product will be delayed by more than 100 days.
These N lines are followed by a line with the number of customers to be processed, C (0 < C <= 500). For each customer, there follows a line with the customer number, the number of products wishing to be purchased, P, and the maximum days they are prepared to wait for a product, M. (0 < P <= N, 0 < M <100) Each of these 3 numbers is separated by a single space. There follows P lines listing the products they wish to order, each on a single line.
For each customer in a scenario, output the customer number followed by the value of their purchases, separated by a space, on a single line. If a product is not available within the timeframe set by the customer, then it is deemed that the product has not been bought, and that the customer is therefore discontented. On the same line, following the value, output an asterisk (*) if that customer has not purchased something they wanted due to shipping delays. The value and asterisk, if applicable, should be separated by a single space. The final line of each scenario's output contains the text "Number of discontented customers is: ", followed by the number of customers in that scenario who could not obtain all their products (ie the number of asterisks).
3 iPodNano 255 0 DucksFeetPerfume 120 15 SilverCharmPendant 180 3 3 1001 2 3 iPodNano SilverCharmPendant 1860 1 5 DucksFeetPerfume 1025 2 6 iPodNano DucksFeetPerfume 0
1001 435 1860 0 * 1025 255 * Number of discontented customers is: 2
The 2 products 1001 wants can both be shipped within the customer's time frame.
Customer 1860’s purchase can’t be shipped within his timeframe and so no purchase is made, and the customer is discontented.
With customer 1025, one product can be shipped in an acceptable time, the other cannot. The iPod is thus sold (cost 255) but the perfume is not, hence the *.
This makes 2 customers who could not complete their purchases