1. Jojo and his classmates like to answer question not in sequence. This make their teacher confuse when checking their answer. So their teacher asked you to sort their answer by the smallest number to the largest, it is guranteed that all number only appear once. Because you don't have time to do it manually you have to make a program to read input from "testdata.in" and output the sorted sequence of given answer in console. To make this problem easier try using struct. Format Input The first line contain an integer T represents the number of test cases. Each test case start with integer N represents how many answer there are. The next N-lines is formatted "A. X" where A is an integer represents the problem's number and X is a character represents the answer. Format Output The sorted answer for each test cases. Constraints 1 <= T <= 20 1 <= N <= 100 1 <= A <= N It is guaranteed that A is all distinct in a single test case.  It is guaranteed that X is an uppercase character.

Programming Logic & Design Comprehensive
9th Edition
ISBN:9781337669405
Author:FARRELL
Publisher:FARRELL
Chapter5: Looping
Section: Chapter Questions
Problem 14RQ
icon
Related questions
Question
100%

1. Jojo and his classmates like to answer question not in sequence. This make their teacher confuse when checking their answer. So their teacher asked you to sort their answer by the smallest number to the largest, it is guranteed that all number only appear once. Because you don't have time to do it manually you have to make a program to read input from "testdata.in" and output the sorted sequence of given answer in console. To make this problem easier try using struct.

Format Input

The first line contain an integer T represents the number of test cases. Each test case start with integer N represents how many answer there are. The next N-lines is formatted "A. X" where A is an integer represents the problem's number and X is a character represents the answer.

Format Output

The sorted answer for each test cases.

Constraints

1 <= T <= 20

1 <= N <= 100

1 <= A <= N

It is guaranteed that A is all distinct in a single test case. 

It is guaranteed that X is an uppercase character.

Sample Input (testdata.in)
Sample Output
4
Сазе #1:
2
1. В
2. А
2. А
1. В
Cазе #2:
5
1. А
1. А
2. С
5. В
3. D
3. D
4. Е
4. Е
5. В
2. С
Cазе #3:
1
1. С
1. С
Cазе #4:
1. А
5. Е
2. В
4. D
3. С
3. С
4. D
2. В
5. Е
1. А
Transcribed Image Text:Sample Input (testdata.in) Sample Output 4 Сазе #1: 2 1. В 2. А 2. А 1. В Cазе #2: 5 1. А 1. А 2. С 5. В 3. D 3. D 4. Е 4. Е 5. В 2. С Cазе #3: 1 1. С 1. С Cазе #4: 1. А 5. Е 2. В 4. D 3. С 3. С 4. D 2. В 5. Е 1. А
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 4 steps with 3 images

Blurred answer
Knowledge Booster
Problems on Dynamic Programming
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Programming Logic & Design Comprehensive
Programming Logic & Design Comprehensive
Computer Science
ISBN:
9781337669405
Author:
FARRELL
Publisher:
Cengage
Systems Architecture
Systems Architecture
Computer Science
ISBN:
9781305080195
Author:
Stephen D. Burd
Publisher:
Cengage Learning
COMPREHENSIVE MICROSOFT OFFICE 365 EXCE
COMPREHENSIVE MICROSOFT OFFICE 365 EXCE
Computer Science
ISBN:
9780357392676
Author:
FREUND, Steven
Publisher:
CENGAGE L