module app;

import core.bitop;

import std.algorithm;
import std.array;
import std.bigint;
import std.conv;
import std.stdio;
import std.string;

struct Input
{
	int n;
	int k;
	long[] h;
}

void parseInput(T)(out Input input, T file)
{
	with (file) with (input)
	{
		auto array = readln().strip().split();
        n = array[0].to!int;
        k = array[1].to!int;
		h = readln().strip().split().map!(to!long).array;
	}
}

struct Output
{
}

auto main2(Input* input)
{
    input.h.sort!"a>b";

    if (input.k < input.n)
        return sum(input.h[input.k..$]);
    else
        return 0;
}

unittest { writeln("begin unittest"); }

unittest // example1
{
	string example =
`3 1
4 1 5`;
	Input input = void;
	parseExample(input, example);
	auto result = main2(&input);
	writeln(result);
	assert(result == 5);
}

unittest // example2
{
	string example =
`8 9
7 9 3 2 3 8 4 6`;
	Input input = void;
	parseExample(input, example);
	auto result = main2(&input);
	writeln(result);
	assert(result == 0);
}

unittest // example3
{
	string example =
`3 0
1000000000 1000000000 1000000000`;
	Input input = void;
	parseExample(input, example);
	auto result = main2(&input);
	writeln(result);
	assert(result == 3000000000);
}

unittest { writeln("end unittest"); }

void parseExample(out Input input, string example)
{
	struct Adapter
	{
		string[] _lines;
		this(string input) { _lines = input.splitLines(); }
		string readln() { auto line = _lines[0]; _lines = _lines[1..$]; return line; }
	}
	parseInput(input, Adapter(example));
}

void main()
{
	Input input = void;
	parseInput(input, stdin);
	auto result = main2(&input);
	writeln(result);
}
