Cod sursa(job #3164588)
Utilizator | Data | 3 noiembrie 2023 19:09:04 | |
---|---|---|---|
Problema | Deque | Scor | 20 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.62 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("deque.in");
ofstream fout("deque.out");
int n,k;long long x,s,minim;
deque<long long> dq_minim;
int main()
{
fin>>n>>k;
fin>>x;
dq_minim.push_front(x);
for(int i = 1; i<k - 1; i++){
fin>>x;
dq_minim.push_back(x);
}
for(int i = 1 ; i <= n - k + 1;i++){
fin>>x;
dq_minim.push_back(x);
minim = LLONG_MAX;
for(long long j : dq_minim)
if(j < minim)
minim = j;
s+=minim;
dq_minim.pop_front();
}
fout<<s;
return 0;
}