#include<stdio.h>
long long int h[200005], l;
int comp_h(long long int a, long long int b)
{
	if (h[a] > h[b])
		return 1;
	else
		return -1;
}
void swap_h(long long int a, long long int b)
{
	long long int f = h[a];
	h[a] = h[b];
	h[b] = f;
	return;
}
void push(long long int ne)
{
	h[l] = ne;
	long long int p = l;
	l++;
	for (; p > 0; p = (p - 1) / 2)
		if (comp_h((p - 1) / 2, p) > 0)
			swap_h((p - 1) / 2, p);
	return;
}
long long int pop()
{
	l--;
	swap_h(0, l);
	long long int p = 0;
	for (;;)
	{
		if (2 * p + 2 < l)
		{
			if (comp_h(2 * p + 1, 2 * p + 2) > 0)
			{
				if (comp_h(p, 2 * p + 2) > 0)
					swap_h(p, 2 * p + 2);
				p = 2 * p + 2;
			}
			else
			{
				if (comp_h(p, 2 * p + 1) > 0)
					swap_h(p, 2 * p + 1);
				p = 2 * p + 1;
			}
		}
		else if (2 * p + 1 < l)
		{
			if (comp_h(p, 2 * p + 1) > 0)
				swap_h(p, 2 * p + 1);
			p = 2 * p + 1;
		}
		else
			break;
	}
	return h[l];
}
long long int a[200005];
int main()
{
	int n, k;
	scanf("%d %d", &n, &k);
	int i, j;
	for (i = 0; i < n; i++)
		scanf("%lld", &a[i]);
	l = 0;
	long long int sum = 0;
	for (i = n - 1; i > n - k; i--)
	{
		sum += a[i];
		push(a[i]);
	}
	if ((n + k) % 2 == 0)
	{
		push(a[i]);
		sum += a[i];
		j = pop();
		sum -= j;
		i--;
	}
	long long int ans = sum + a[i];
	while (i > 0)
	{
		push(a[i]);
		sum += a[i];
		j = pop();
		sum -= j;
		i--;
		push(a[i]);
		sum += a[i];
		j = pop();
		sum -= j;
		i--;
		if (i < 0)
			break;
		if (ans < sum + a[i])
			ans = sum + a[i];
	}
	printf("%lld\n", ans);
	return 0;
}