ACM练习题目.docVIP

A:Conquistador Time Limit: 1000MS Memory Limit: 65536K Description Rune Johan is a nice young boy and a clever student, but he has had little luck engaging persons of the female persuasion in fruitful conversation. He was very grateful when the computer science department organised a ball, and invited the first grade nurse students. There he saw her, the woman of his dreams. But as most of us do in such situations, he froze up, and did not dare to approach her. After a few days of regretting his lack of action, Rune Johan decides to make up for it. He finds her name, Celina Middleware, but does not want to contact her before he has made a decent plan. He starts by locating one of her friends, Bj?rgfrid, and invites her to a cup of coffee. After a few minutes of conversation, Bj?rgfrid tells that she has some trouble with her computer. Rune Johan makes a deal with her. He will fix her computer if she tells him everything he needs to know about Celina. It turns out that Celina likes many different kinds of boys, but she is still rather picky. He could be intelligent, cultivated and well dressed, or own a motorcycle and be slightly rude. Or he could simply be rich. Rune Johan writes down all the information, and goes home to finish his plan. He makes an estimate of how many weeks it would take to fulfil each of the criteria, and tries to decide which combination takes less time. He thinks that he can work on all of them in parallel. Figure 1: What Rune Johan must become to conquer Celina Middleware. Input The first line of input gives the number of test cases, which is at most 100. Each test case is given as two strings on separate lines. The first string gives the time costs of fulfilling the criteria, separated by commas. Each cost is given by a string giving the name of the criterion, a colon, and then the integer time cost of the criterion in weeks. The names contain symbols ’a’ to ’z’, and their length is from 1 to 20. The costs are between 0 and 1000 inclu