Submission #11584789
Source Code Expand
N = int(input())
Xc = [list(input().split()) for _ in range(N)]
X = []
for i in range(N):
X.append([int(Xc[i][0]),Xc[i][1]])
X.sort()
for i in range(N):
if X[i][1] == 'R':
print(X[i][0])
for i in range(N):
if X[i][1] == 'B':
print(X[i][0])
Submission Info
| Submission Time | |
|---|---|
| Task | B - Picking Balls |
| User | temp_name |
| Language | Python (3.8.2) |
| Score | 200 |
| Code Size | 298 Byte |
| Status | AC |
| Exec Time | 21 ms |
| Memory | 9208 KiB |
Judge Result
| Set Name | Sample | All | ||||
|---|---|---|---|---|---|---|
| Score / Max Score | 0 / 0 | 200 / 200 | ||||
| Status |
|
|
| Set Name | Test Cases |
|---|---|
| Sample | s1.txt, s2.txt |
| All | 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, s1.txt, s2.txt |
| Case Name | Status | Exec Time | Memory |
|---|---|---|---|
| 01.txt | AC | 17 ms | 9076 KiB |
| 02.txt | AC | 20 ms | 9072 KiB |
| 03.txt | AC | 21 ms | 9068 KiB |
| 04.txt | AC | 16 ms | 8908 KiB |
| 05.txt | AC | 18 ms | 8916 KiB |
| 06.txt | AC | 16 ms | 9008 KiB |
| 07.txt | AC | 17 ms | 9080 KiB |
| 08.txt | AC | 17 ms | 8912 KiB |
| 09.txt | AC | 20 ms | 9068 KiB |
| 10.txt | AC | 16 ms | 9016 KiB |
| 11.txt | AC | 18 ms | 9204 KiB |
| 12.txt | AC | 16 ms | 9016 KiB |
| 13.txt | AC | 18 ms | 9144 KiB |
| 14.txt | AC | 17 ms | 8904 KiB |
| 15.txt | AC | 17 ms | 9068 KiB |
| 16.txt | AC | 17 ms | 9136 KiB |
| 17.txt | AC | 17 ms | 9020 KiB |
| 18.txt | AC | 20 ms | 9024 KiB |
| 19.txt | AC | 17 ms | 9020 KiB |
| s1.txt | AC | 21 ms | 9208 KiB |
| s2.txt | AC | 17 ms | 9136 KiB |