Cod sursa(job #3324805)
| Utilizator | Data | 23 noiembrie 2025 16:23:54 | |
|---|---|---|---|
| Problema | Deque | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.51 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin ("deque.in");
ofstream fout ("deque.out");
char v[1001];
int main()
{
int n,k;
fin>>n>>k;
for(int i=1;i<=n;i++)
{
fin>>v[i];
}
int S=0;
for(int i=1;i<=n-k+1;i++)
{
int mini=1000000;
for(int ii=i;ii<i+k;ii++)
{
if(v[ii]<mini)
{
mini=v[ii];
}
}
S=S+mini;
}
cout <<S;
return 0;
}
