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 Shadab Cpp14 0.00s
02 Najat Cpp14 0.00s
03 showmic Cpp14 0.00s
04 omaer1510033 Cpp14 0.00s
05 marineCoder Cpp14 0.00s
06 anamika_mou Cpp14 0.00s
07 Dinar Cpp14 0.00s
08 Ashish972 Cpp14 0.00s
09 Dilshad_Dolon Cpp14 0.00s
10 maxhasan Cpp14 0.00s
11 gazi93 Cpp14 0.00s
12 MAHRahat Cpp14 0.00s
13 alamin_IT Cpp14 0.00s
14 tssovi Cpp14 0.00s
15 gulzar Cpp14 0.00s
16 nurul_islam Cpp14 0.00s
17 sukanta Cpp14 0.00s
18 Nazmul0092 Cpp14 0.00s
19 smriad Cpp14 0.00s
20 Saimum_140128 Cpp14 0.00s
21 jayed_al_hasan Cpp14 0.00s
22 Tajir Cpp14 0.00s
23 lolcoder Cpp14 0.00s
24 sumaiya710 Cpp14 0.00s
25 tanhakabir Cpp14 0.00s
26 afzalul Cpp14 0.00s
27 opu1604073 Cpp14 0.00s
28 Pritha_1604122 Cpp14 0.00s
29 esha1604103 Cpp14 0.00s
30 CSE1604084_Mahir Cpp14 0.00s
31 Momin_just Cpp14 0.00s
32 SakibAlamin Cpp14 0.00s
33 feodorv Cpp14 0.00s
34 Alamgir_1604069 C 0.00s
35 virus C 0.00s
36 TAISEER990 Cpp14 0.00s
37 sadia2427 Cpp14 0.00s
38 Alice_2 Cpp14 0.00s
39 Core_i14 Cpp14 0.00s
40 hmtanbir Cpp14 0.00s
41 1604099_ishtiaq C 0.00s
42 Tanvir12 Cpp 0.00s
43 shibli1604128 Cpp 0.00s
44 DynamicOvi Cpp 0.00s
45 _JaHid_ C 0.00s
46 Afif_Fahim C 0.00s
47 ashish_pondit Cpp 0.00s
48 Morass Cpp14 0.00s
49 10102020 Cpp 0.00s
50 milon019 Cpp 0.00s

Your feedback is our precious!

Or call +88 02 9853138 for support