Submission #76442258


Source Code Expand

from collections import defaultdict
N,K,M = map(int,input().split())
d = defaultdict(list)
for _ in range(N):
    C,V=map(int,input().split())
    d[C].append(V)
for i,j in d.items():
    j.sort()
l = [j for i,j in d.items()]
l.sort(key=lambda d:d[-1],reverse=True)
dat = []
ans = 0
for i,j in enumerate(l):
    if i<M:
        ans+=j.pop()
        dat.extend(j)
    else:
        dat.extend(j)
dat.sort()
for _ in range(K-M):
    ans += dat.pop()
print(ans)

Submission Info

Submission Time
Task C - Variety
User shogo314
Language Python (PyPy 3.11-v7.3.20)
Score 300
Code Size 481 Byte
Status AC
Exec Time 436 ms
Memory 155268 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 300 / 300
Status
AC × 3
AC × 23
Set Name Test Cases
Sample sample-01.txt, sample-02.txt, sample-03.txt
All 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, 20.txt, 21.txt, 22.txt, 23.txt, sample-01.txt, sample-02.txt, sample-03.txt
Case Name Status Exec Time Memory
04.txt AC 64 ms 93524 KiB
05.txt AC 263 ms 118812 KiB
06.txt AC 303 ms 151080 KiB
07.txt AC 288 ms 128860 KiB
08.txt AC 64 ms 93488 KiB
09.txt AC 68 ms 96612 KiB
10.txt AC 90 ms 109320 KiB
11.txt AC 210 ms 121440 KiB
12.txt AC 400 ms 139312 KiB
13.txt AC 436 ms 148612 KiB
14.txt AC 432 ms 147084 KiB
15.txt AC 362 ms 133644 KiB
16.txt AC 345 ms 135236 KiB
17.txt AC 350 ms 134284 KiB
18.txt AC 347 ms 129892 KiB
19.txt AC 367 ms 133948 KiB
20.txt AC 341 ms 135388 KiB
21.txt AC 429 ms 155268 KiB
22.txt AC 296 ms 148248 KiB
23.txt AC 345 ms 136780 KiB
sample-01.txt AC 64 ms 93360 KiB
sample-02.txt AC 64 ms 93620 KiB
sample-03.txt AC 64 ms 93628 KiB