题解 | 小红闯关

#include <iostream>
using namespace std;
#include<algorithm>
#include<set>
#include<vector>
int main(){
int n,k;
cin>>n>>k;
long long c=0;
long long save=0;
multiset<int >a;
vector<int>d(n+1);
for(int i=1;i<=n;i++){
int b;
cin>>b;
c+=b;
d[i]=b;




}
for(int i=n;i>=1;i--){

if(i%k==0&&!a.empty()){
    save+=*prev(a.end());
    a.erase(prev(a.end()));

}
a.insert(d[i]);




}
cout<<c-save;





    return 0;
}