Cod sursa(job #2041263)
| Utilizator | Data | 17 octombrie 2017 00:17:12 | |
|---|---|---|---|
| Problema | Deque | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.49 kb |
#include <bits/stdc++.h>
#define nMax 10000001
using namespace std;
ifstream f("deque.in");
ofstream g("deque.out");
int main(){
int n,k;f>>n>>k;
int x,minn=nMax,minn2=nMax,s=0,pm1,pm2;
for(int i=1;i<=n;++i){
f>>x;
if(x<minn) {minn=x;pm1=i;minn2=nMax;}
else if(x<minn2) {minn2=x;pm2=i;}
if(i-pm1==k){
minn=minn2;pm1=pm2;
}
if(i>=k) {g<<minn<<" ";s+=minn;}
}
g<<s;
}
