Cod sursa(job #1600245)
| Utilizator | Data | 14 februarie 2016 20:03:24 | |
|---|---|---|---|
| Problema | Deque | Scor | 20 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.52 kb |
#include <fstream>
#include <vector>
using namespace std;
ifstream f("deque.in");
ofstream g("deque.out");
long long S;
int main()
{
vector <long long> v;
long long N,K,i,j,x;
f>>N>>K;
for(i=0;i<N;++i){
f>>x;
v.push_back(x);
}
long long p=K;
for(i=0;i<=N-K;++i){
long long minn=10000000;
for(j=i;j<p;++j)
if(v[j]<minn) minn=v[j];
S+=minn;
p++;
}
g<<S<<"\n";
f.close();
g.close();
return 0;
}
