Cod sursa(job #1538197)
Utilizator | Data | 28 noiembrie 2015 17:31:39 | |
---|---|---|---|
Problema | Deque | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("deque.in");
ofstream g("deque.out");
int a[10000];
int main()
{
int n,k,s=0;
f >> n >> k;
for (int i = 0; i < n; i++)
f >> a[i];
for (int i = 0; i < n-k; i++)
{
s =s+ min(a[i], a[k + i]);
}
g << s<<endl;
return 0;
}