DCP-192: Bicycle Back to All Problems

Beginner Beginners Problems > Ad-hoc

---

Little Kiron wants to buy a Bicycle but as he is little he don't have much money. Now he went to the cycle shop and form there he will buy a bicycle. There are N bicycle in the shop of different price. He will buy the cycle which value is the least. But now a days only buying bicycle is not enough it also need maintain cost. So if two bicycle has the least value he will buy that one which have less maintain cost. Input: ------ Input starts with an integer **T (1<=20)**, denoting the number of test cases. Each case contains an integer **N (2 ≤ N ≤ 1000)** denoting the number of bicycle in the shop. The next N line will contain 2 integers separated by spaces, denoting the price of the cycle and the maintain cost of per month. Each of these integers will be in the range of 64 bit unsigned integer number. Output: ------- For each case of input, output the case number starting from 1 and print the value and the maintain cost of the cycle which kiron will buy. Sample Input ------------ 1 2 100 10 350 100 Sample Output ------------- Case 1: 100 10

---

Problem Setter:

Sifat Rabbi

---

Please login to submit solution to this problem.