Cod sursa(job #2728494)
Utilizator | Data | 23 martie 2021 12:41:58 | |
---|---|---|---|
Problema | Deque | Scor | 20 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include <iostream>
#include <fstream>
#include <vector>
#include <stdlib.h>
using namespace std;
ifstream f("deque.in");
ofstream g("deque.out");
long long k, n, i, j, mini, s, x, ck,cn, v[100000];
int main()
{
f>>n>>k;
cn=n;
for(i=0;i<n;i++)
f>>v[i];
for(i=0; i<=cn-k; i++)
{
mini=v[i];
for(j=i+1; j<i+k; j++)
{
if (v[j]<mini)
mini=v[j];
}
s+=mini;
}
g<<s;
return 0;
}