Pagini recente » Cod sursa (job #2920526) | Cod sursa (job #297765) | Cod sursa (job #2459668) | Cod sursa (job #2371287) | Cod sursa (job #2451655)
#include <stdio.h>
#include <stdlib.h>
int v[5000000];
int main() {
FILE *fin = fopen( "deque.in", "r" ), *fout = fopen( "deque.out", "w" );
int n, k, i, j0, j1, j2, a;
long long s;
fscanf( fin, "%d%d%d", &n, &k, &a );
v[0] = a;
j0 = 1;
for ( i = 1; i < n; i ++ ) {
fscanf( fin, "%d", &a );
v[j0] = a;
j0 ++;
j1 = j0 - 2;
j2 = 0;
while ( j1 >= 0 && a < v[j1] && j2 < k - 1 ) {
v[j1] = a;
j2 ++;
j1 --;
}
}
s = 0;
for ( i = 0; i < n - k + 1; i ++ ) {
s += v[i];
}
fprintf( fout, "%lld", s );
fclose( fin );
fclose( fout );
return 0;
}