Cod sursa(job #2889397)
Utilizator | Data | 12 aprilie 2022 18:43:19 | |
---|---|---|---|
Problema | Deque | Scor | 20 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.51 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("deque.in");
ofstream g("deque.out");
int n,d[5000002],v[5000002],k,i=1,j,fr,m,mn=10000001,sum;
int main() {
f >> n >> k;
while(i<=n)
{
f>>d[m];
for(j=fr;j<=m;j++)
{
if (d[j] < mn)
{
mn = d[j];
}
}
m++;
if(i>=k)
{
sum+=mn;
fr++;
mn=d[fr];
}
i++;
}
g<<sum;
return 0;
}