Distinct Elements with Minimum Total Cost

You are given N integers, where the i-th integer is v_i and its associated cost is c_i. You want to select a subset of these integers such that there are exactly K distinct values among the selected integers. The cost of selecting an integer v_i with cost c_i is c_i. You want to minimize the total cost of selected integers to achieve K distinct values. If multiple sets of selections achieve K distinct values with the minimum total cost, choose the one that uses the smallest number of selected integers. If there is still a tie, choose the one that lexicographically smallest set of selected values (sorted in ascending order). Print the minimum total cost and the minimum number of elements selected for that cost.