在懒人国，国王需要分配k项任务给n个懒人，每个懒人只能选择一项任务。已知每个懒人选的任务和说服他们改变任务所需的时间。题目要求计算最小的总说服时间以确保所有任务完成。输入包括任务数、懒人数、每个懒人选的任务和说服时间，输出是最小总说服时间。第一例中，需要说服第1、6、8号懒人改做其他任务。第二例中，所有任务都有人选，无需说服。
The kingdom of Lazyland is the home to nn idlers. These idlers are incredibly lazy and create many problems to their ruler, the mighty King of Lazyland.
Today kk important jobs for the kingdom (k≤nk≤n) should be performed. Every job should be done by one person and every person can do at most one job. The King allowed every idler to choose one job they wanted to do and the ii-th idler has chosen the job aiai.
Unfortunately, some jobs may not be chosen by anyone, so the King has to persuade some idlers to choose another job. The King knows that it takes bibi minutes to persuade the ii-th idler. He asked his minister of labour to calculate the minimum total time he needs to spend persuading the idlers to get all the jobs done. Can you help him?
Input
The first line of the input contains two integers nn and kk (1≤k≤n≤1051≤k≤n≤105) — the number of idlers and the number of jobs.
The second line of the input contains nn integers a1,a2,…,ana1,a2,…,an
最低0.47元/天 解锁文章
扫一扫
1328
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
