Answered: Jojo and his classmates like to answer…

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Related questions

Question

[35%] 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 "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

2. A

1. B

1. A

5. B

3. D

4. E

2. C

1. C

5. E

4. D

3. C

2. B

1. A

Case #1:

1. B

2. A

Case #2:

1. A

2. C

3. D

4. E

5. B

Case #3:

1. C

Case #4:

1. A

2. B

3. C

4. D

5. E

Expert Solution

Step by step

Solved in 2 steps with 1 images

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

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