Submission #27397188
Source Code Expand
N,K=list(map(int,input().split()))
P = [0 for i in range(N)]
for i in range(N):
p = list(map(int,input().split()))
P[i] = p[0]+p[1]+p[2]
#print(P[i])
PP = sorted(P, reverse=True)
for i in range(N):
#print(P[i] + 300, PP[K-1])
if P[i] + 300 >= PP[K-1]:
print("Yes")
else:
print("No")
Submission Info
| Submission Time | |
|---|---|
| Task | C - Final Day |
| User | umagemarc |
| Language | Python (3.8.2) |
| Score | 300 |
| Code Size | 336 Byte |
| Status | AC |
| Exec Time | 288 ms |
| Memory | 13496 KiB |
Judge Result
| Set Name | Sample | All | ||||
|---|---|---|---|---|---|---|
| Score / Max Score | 0 / 0 | 300 / 300 | ||||
| Status |
|
|
| Set Name | Test Cases |
|---|---|
| Sample | example_00.txt, example_01.txt, example_02.txt |
| All | example_00.txt, example_01.txt, example_02.txt, max.txt, min.txt, test_00.txt, test_01.txt, test_02.txt, test_03.txt, test_04.txt, test_05.txt, test_06.txt, test_07.txt |
| Case Name | Status | Exec Time | Memory |
|---|---|---|---|
| example_00.txt | AC | 18 ms | 9052 KiB |
| example_01.txt | AC | 26 ms | 8844 KiB |
| example_02.txt | AC | 18 ms | 8940 KiB |
| max.txt | AC | 273 ms | 13496 KiB |
| min.txt | AC | 19 ms | 8980 KiB |
| test_00.txt | AC | 287 ms | 13484 KiB |
| test_01.txt | AC | 98 ms | 9984 KiB |
| test_02.txt | AC | 91 ms | 9968 KiB |
| test_03.txt | AC | 189 ms | 11588 KiB |
| test_04.txt | AC | 50 ms | 9136 KiB |
| test_05.txt | AC | 288 ms | 12448 KiB |
| test_06.txt | AC | 244 ms | 11316 KiB |
| test_07.txt | AC | 268 ms | 11828 KiB |