Submission #76563759

Source Code Expand

N, W = map(int, input().split())
dic = {}
A = []
for i in range(N):
  a, b = map(int, input().split())
  A.append(a)
  if a in dic :
    dic[a] += b
  else:
    dic[a] = b
s = set(A)
A = list(s)
A.sort(reverse=True)
N = len(A)
#print(dic)

v = 0
for i in range(N):
  if dic[A[i]] < W :
    W -= dic[A[i]]
    v += A[i]*dic[A[i]]
  else:
    v += A[i]*W
    break
print(v)

Submission Info

Submission Time
Task F - Cheese
User monte0618
Language Python (PyPy 3.11-v7.3.20)
Score 300
Code Size 395 Byte
Status AC
Exec Time 496 ms
Memory 219912 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 300 / 300
Status
AC × 3
AC × 22
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt
All minimum_01.txt, minimum_02.txt, sample_01.txt, sample_02.txt, sample_03.txt, test_01.txt, test_02.txt, test_03.txt, test_04.txt, test_05.txt, test_06.txt, test_07.txt, test_08.txt, test_09.txt, test_10.txt, test_11.txt, test_12.txt, test_13.txt, test_14.txt, test_15.txt, test_16.txt, test_17.txt
Case Name Status Exec Time Memory
minimum_01.txt AC 52 ms 79888 KiB
minimum_02.txt AC 51 ms 79916 KiB
sample_01.txt AC 51 ms 79680 KiB
sample_02.txt AC 50 ms 79620 KiB
sample_03.txt AC 50 ms 79716 KiB
test_01.txt AC 51 ms 79704 KiB
test_02.txt AC 51 ms 79720 KiB
test_03.txt AC 51 ms 79680 KiB
test_04.txt AC 411 ms 192444 KiB
test_05.txt AC 125 ms 116560 KiB
test_06.txt AC 354 ms 179028 KiB
test_07.txt AC 157 ms 123684 KiB
test_08.txt AC 238 ms 143972 KiB
test_09.txt AC 194 ms 135016 KiB
test_10.txt AC 162 ms 127144 KiB
test_11.txt AC 281 ms 154312 KiB
test_12.txt AC 492 ms 219884 KiB
test_13.txt AC 489 ms 219864 KiB
test_14.txt AC 488 ms 219528 KiB
test_15.txt AC 485 ms 219844 KiB
test_16.txt AC 496 ms 219912 KiB
test_17.txt AC 334 ms 125628 KiB