Pagini recente » Cod sursa (job #1870678) | FmiNoStress 10 ani selectie probleme 1 | Diferente pentru implica-te/arhiva-educationala intre reviziile 76 si 77 | Cod sursa (job #3175058) | Cod sursa (job #2839418)
#include <bits/stdc++.h>
#define ll long long
using namespace std;
ifstream fin("deque.in");
ofstream fout("deque.out");
const int dim=5000009;
int n,k,v[dim];
multiset<int>s;
signed main(){
fin>>n>>k;
for(int i=1;i<=n;i++){
fin>>v[i];
}
for(int i=1;i<k;i++){
s.insert(v[i]);
}
ll ans=0;
for(int i=k;i<=n;i++){
s.insert(v[i]);
ans+=*s.begin();
s.erase(v[i-k+1]);
}
fout<<ans;
}