Cod sursa(job #2731155)
Utilizator | Data | 27 martie 2021 13:34:44 | |
---|---|---|---|
Problema | Deque | Scor | 20 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include <fstream>
using namespace std;
ifstream f("deque.in");
ofstream g("deque.out");
int a[5000000];
int main() {
int x,n,k,s=0;
f>>n>>k;
for(int i = 0 ; i < n ; ++i)
{
f>>x;
for(int j = i ; j < i+k && j < n ; ++j)
if(a[j]>x || a[j] == 0)
a[j]=x;
}
for(int i = k-1 ; i < n ; ++i)
s+=a[i];
g<<s;
return 0;
}