Submission #39533642
Source Code Expand
n, m = map(int, input().split())
a = [0] * n
for i in range(n):
a[i] = int(input())
b = [0] * m
for i in range(m):
b[i] = int(input())
cnt = [0] * n
for member_id in range(m):
for comp_id in range(n):
if a[comp_id] <= b[member_id]:
cnt[comp_id] += 1
break
answer = 0
for i in range(n):
if cnt[answer] < cnt[i]:
answer = i
print(answer + 1)
Submission Info
| Submission Time | |
|---|---|
| Task | B - 投票 (Vote) |
| User | Pro_ktmr |
| Language | PyPy3 (7.3.0) |
| Score | 100 |
| Code Size | 414 Byte |
| Status | AC |
| Exec Time | 163 ms |
| Memory | 74308 KiB |
Judge Result
| Set Name | set01 | set02 | set03 | set04 | set05 | ||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| Score / Max Score | 20 / 20 | 20 / 20 | 20 / 20 | 20 / 20 | 20 / 20 | ||||||||||
| Status |
|
|
|
|
|
| Set Name | Test Cases |
|---|---|
| set01 | data1 |
| set02 | data2 |
| set03 | data3 |
| set04 | data4 |
| set05 | data5 |
| Case Name | Status | Exec Time | Memory |
|---|---|---|---|
| data1 | AC | 163 ms | 61476 KiB |
| data2 | AC | 79 ms | 73584 KiB |
| data3 | AC | 75 ms | 70656 KiB |
| data4 | AC | 91 ms | 74076 KiB |
| data5 | AC | 90 ms | 74308 KiB |