Cod sursa(job #1982274)
Utilizator | Data | 18 mai 2017 00:19:21 | |
---|---|---|---|
Problema | Deque | Scor | 0 |
Compilator | cpp | 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 v[5000001];
int m,n,k;
long long s=0,x=0,i;
int main()
{
f>>n>>k;
for(i=1;i<=n;i++)
f>>v[i];
m=v[x+1];
for(i=1+x;i<=k+x;i++)
{
if (v[i]<m)
{
m=v[i];
}
}
if (x<=n-k)
x++;
s=s+m;
g<<s;
return 0;
}