Pagini recente » Cod sursa (job #1493789) | Cod sursa (job #489582) | Cod sursa (job #2753483) | Cod sursa (job #885300) | Cod sursa (job #2889732)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("deque.in");
ofstream g("deque.out");
int n,i,j,p,u,k;
long x,min1,s,v[9999999];
int main()
{
f>>n>>k;
f>>x;
min1=x;
p=1;
u=2;
v[1]=x;
for(i=2;i<=k;i++)
{
f>>x;
if(x<min1)
min1=x;
v[u]=x;
u++;
}
s=min1;
for(i=k+1;i<=n;i++)
{
f>>x;
p++;
v[u]=x;
u++;
min1=x;
for(j=p;j<=u-1;j++)
if(v[j]<min1)
min1=v[j];
cout<<s<<endl;
s+=min1;
}
g<<s;
for(i=1;i<=u;i++)
cout<<v[i]<<" ";
return 0;
}