DCP-569: Jersey Number 10 Back to All Problems

Easy Beginners Problems > Implementation

Whole world is now affected with football fever. World Cup 2018 Russia is full of surprises. Whatever, the authority is facing problem in distributing **jersey number 10**. You know jersey number 10 is the most precious one. They have decided to give the jersey number 10 to that player who is the **most skilled one**. You are given a list of name and skill of players. You are to determine who is going to get the jersey number 10. **If there are multiple players those are fit for jersey number 10 then select that player with most experience. For *X<sup>th</sup>* player the experience is *X* year.** For example, let you have a list of 3 players. The first player is with experience 1, the second player is with experience 2 and the third player is with experience 3 years respectively. Input: ------ Inputs starts with an integer **T** denote the test cases. Each of the next T line contains an integer **N** that denotes the number of players. Each of the next N lines a **string X** and an **integer Y** denoting the name of player and the skill of player. It is guaranteed that all names are distinct and consists of uppercase Latin alphabets. Constraints: -------- 1 <= **T** <= 100<br> 1<= **N, Y** <= 50<br> 1<=**length of X** <= 3 Output: ------- For each of test case print the name of the player who is going to get the **jersey number 10** in a single line. Sample Input ------------ 1 3 ML 10 RC 8 RJN 7 Sample Output ------------- ML

Problem Setter:

Avik Sarkar

Please login to submit solution to this problem.

Problem Limits

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

Problem Stats




# User Language Timing
01 kzvd4729 Cpp14 0.00s
02 shahidul_brur Cpp 0.00s
03 emrul Cpp 0.00s
04 Pure_Protea Cpp14 0.00s
05 _GhOstMan_ Cpp 0.00s
06 shahed95 Cpp 0.00s
07 muradhossen Cpp 0.00s
08 _c_k_r_ Cpp 0.00s
09 tawhidkuet04 Cpp 0.00s
10 ehsan_sshuvo96 Cpp 0.00s
11 Bisnu039 Cpp 0.00s
12 mariaregina Cpp 0.00s
13 ikaadil Cpp 0.00s
14 mohibur Cpp 0.00s
15 himisir Cpp 0.00s
16 Nasif_44th C 0.00s
17 shuvo_mbstu Cpp 0.00s
18 Fazle Cpp14 0.00s
19 Shafquat Cpp 0.00s
20 Ataur Cpp 0.00s
21 Naim_BSMRSTU Cpp 0.00s
22 imunir Cpp14 0.00s
23 t_33 Cpp 0.00s
24 Farhan_mahbub Cpp 0.00s
25 ivax6 Cpp14 0.00s
26 Mahadi_Hasan Cpp 0.00s
27 SIAM_SP Cpp 0.00s
28 DynamicOvi Cpp 0.00s
29 Bipro_Bhowmik Cpp14 0.00s
30 shishir09 Cpp14 0.00s
31 opu1604073 Cpp 0.00s
32 Mr_adnan Cpp 0.00s
33 sohel__sec Cpp14 0.00s
34 Mushfiqur_Rahman C 0.00s
35 naimurrahman Cpp14 0.00s
36 sahil_bansal Cpp 0.00s
37 nill98 Cpp 0.00s
38 shahadat191 Cpp14 0.00s
39 _cicipi_ Cpp14 0.00s
40 SHOVON26 Cpp 0.00s
41 Ahb_arif Cpp14 0.00s
42 Sadi9 Cpp 0.00s
43 marayhan C 0.00s
44 Urmy_Cse_Brur C 0.00s
45 nurbijoy Cpp 0.00s
46 mahbubcseju Cpp 0.00s
47 syed_jafrul_husen Cpp 0.00s
48 Sakhawat_CoU Cpp 0.00s
49 Riyad_Ahmed Cpp14 0.00s
50 muntasir10mu Cpp 0.00s

Your feedback is our precious!

Or call +88 02 9853138 for support