提出 #76478595

---

ソースコード 拡げる

N, K, M = map(int, input().split())
stones = []
for i in range(N):
  stones.append(list(map(int, input().split())))
stones.sort(key=lambda x:x[1], reverse=True)
stone_dict = {}
small_stone_list = []
for k, v in stones:
  if k not in stone_dict:
    stone_dict[k] = v
  elif stone_dict[k] < v:
    small_stone_list.append([k, stone_dict[k]])
    stone_dict[k] = v
  else:
    small_stone_list.append([k, v])
sorted_stone_dict = sorted(stone_dict.items(), key = lambda x: x[1], reverse = True)
small_stone_list.sort(key=lambda x:x[1], reverse=True)

total = 0
for k, v in sorted_stone_dict[:M]:
  total += v

big_stone_list = sorted_stone_dict[M:]
big_i = 0
small_i = 0
for  i in range(K-M):
  if len(small_stone_list) == small_i:
    k, v = big_stone_list[big_i]
    big_i += 1
    total += v
  elif len(big_stone_list) == big_i:
    k, v = small_stone_list[small_i]
    small_i += 1
    total += v
  elif big_stone_list[big_i][1] >= small_stone_list[small_i][1]:
    k, v = big_stone_list[big_i]
    big_i += 1
    total += v
  else:
    k, v = small_stone_list[small_i]
    small_i += 1
    total += v
print(total)

提出情報

ジャッジ結果