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.

Problem Limits

Language Time Limit (seconds)
C 1.00
C++ 1.00
C++14 1.00
C# 2.00
Go 2.00
Java 2.00
JavaScript 2.00
Objective-C 2.00
Perl 2.00
PHP 2.00
Python 2.00
Python3 2.00
Ruby 2.00
VB.Net 2.00

Problem Stats




# User Language Timing
01 MAHRahat Cpp14 0.00s
02 Core_i14 Cpp14 0.00s
03 Saimum_140128 Cpp14 0.00s
04 Nazmul_WUB Cpp14 0.00s
05 showmic Cpp14 0.00s
06 Shadab Cpp14 0.00s
07 Najat Cpp14 0.00s
08 uzzal_rahman Cpp 0.00s
09 maxhasan Cpp14 0.00s
10 gazi93 Cpp14 0.00s
11 shafayet_hossain Cpp 0.00s
12 anamika_mou Cpp14 0.00s
13 wizard Cpp 0.00s
14 Dinar Cpp14 0.00s
15 Sagor Cpp 0.00s
16 afzalul Cpp14 0.00s
17 marineCoder Cpp14 0.00s
18 alamin_IT Cpp14 0.00s
19 virus C 0.00s
20 Tanvir12 Cpp 0.00s
21 feodorv Cpp14 0.00s
22 neel71 C 0.00s
23 gulzar Cpp14 0.00s
24 JubayerSohel Cpp14 0.00s
25 nurul_islam Cpp14 0.00s
26 Momin_just Cpp14 0.00s
27 sukanta Cpp14 0.00s
28 omaer1510033 Cpp14 0.00s
29 MarufAhmed Cpp 0.00s
30 Dilshad_Dolon Cpp14 0.00s
31 milon019 Cpp 0.00s
32 sumaiya710 Cpp14 0.00s
33 Alamgir_1604069 C 0.00s
34 opu1604073 Cpp14 0.00s
35 Tajir Cpp14 0.00s
36 CSE1604084_Mahir Cpp14 0.00s
37 ashish_pondit Cpp 0.00s
38 1604099_ishtiaq C 0.00s
39 tanhakabir Cpp14 0.00s
40 Pritha_1604122 Cpp14 0.00s
41 _JaHid_ C 0.00s
42 shibli1604128 Cpp 0.00s
43 mahmud2690 Cpp14 0.00s
44 esha1604103 Cpp14 0.00s
45 abdulmukit Cpp 0.00s
46 joymollick Cpp 0.00s
47 Afif_Fahim C 0.00s
48 5h4n70 Cpp 0.00s
49 tssovi Cpp14 0.00s
50 Ashish972 Cpp14 0.00s

Your feedback is our precious!

Or call +88 02 9853138 for support