题解 | chika和蜜柑

import sys

def solve():
    data = sys.stdin.read().split()
    ptr = 0
    n = int(data[ptr])
    k = int(data[ptr + 1])
    ptr += 2
    ai = data[ptr:ptr + n]
    ptr += n
    bi = data[ptr:ptr + n]
    ai_int = list(map(int,ai))
    bi_int = list(map(int,bi))

    index_bi = list(enumerate(bi_int))
    sorted_bi = sorted(index_bi,key = lambda x:x[1],reverse = True)
    top_k = [idx for idx,val in sorted_bi[:k]]


    sum_a = 0
    sum_b = 0
    for i in top_k:
        sum_a += ai_int[i]
        sum_b += bi_int[i] 
    print(f"{sum_a} {sum_b}")

solve()