Cod sursa(job #2749859)
| Utilizator | Data | 8 mai 2021 17:31:24 | |
|---|---|---|---|
| Problema | Deque | Scor | 25 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.55 kb |
#include <bits/stdc++.h>
using namespace std;
#define NMAX 5000005
ifstream f("deque.in");
ofstream g("deque.out");
long long n, k, a[NMAX];
int main(){
f >> n >> k;
for(int i=1;i<=n;++i){
f >> a[i];
}
multiset<int> sett;
for(int i=1;i<=k;++i){
sett.insert(a[i]);
}
int sol=0;
for(int i=k+1;i<=n;++i){
sol+=(*sett.begin());
auto it=sett.find(a[i-k]);
sett.erase(it);
sett.insert(a[i]);
}
sol+=(*sett.begin());
g << sol;
return 0;
}