Problem:
Score : 300 points

Problem Statement

Fennec is fighting with N monsters.

The health of the i-th monster is H_i.

Fennec can do the following two actions:

Attack: Fennec chooses one monster. That monster's health will decrease by 1.

Special Move: Fennec chooses one monster. That monster's health will become 0.

There is no way other than Attack and Special Move to decrease the monsters' health.

Fennec wins when all the monsters' healths become 0 or below.

Find the minimum number of times Fennec needs to do Attack (not counting Special Move) before winning when she can use Special Move at most K times.

Constraints

1 \leq N \leq 2 \times 10^5

0 \leq K \leq 2 \times 10^5

1 \leq H_i \leq 10^9

All values in input are integers.

Input

Input is given from Standard Input in the following format:

N K
H_1 ... H_N

Output

Print the minimum number of times Fennec needs to do Attack (not counting Special Move) before winning.

Sample Input 1

3 1
4 1 5

Sample Output 1

5

By using Special Move on the third monster, and doing Attack four times on the first monster and once on the second monster, Fennec can win with five Attacks.

Sample Input 2

8 9
7 9 3 2 3 8 4 6

Sample Output 2

0

She can use Special Move on all the monsters.

Sample Input 3

3 0
1000000000 1000000000 1000000000

Sample Output 3

3000000000

Watch out for overflow.

Solution in C (GCC 5.4.1) (judge verdict: Runtime Error)

#include<stdio.h>
int main(){
	int i,j,temp;
	int n,m;
	int h;
	int a[100];
	float s=0;
	scanf("%d %d",&n,&h);
	for(i=0;i<n;i++){
	scanf("%d",&a[i]);
	}
	  
	  for(i=0; i<n-1; i++){
        for(j=0; j<n-1-i; j++){
            if(a[j] < a[j+1]){
                temp = a[j];
                a[j] = a[j+1];
                a[j+1] = temp;
            }
        }
    }
    
    if(h>0){
    	if(h>=n)
    	printf("0");
    	if(h<n){
    	for(m=0;m<h;m++){
    	s++;
		}
		for(m=h;m<n;m++){
			s+=a[m];
		}
		printf("%.0f",s-1);
	}
		
	}
	else{
	for(i=0;i<n;i++){
		s+=a[i];}
		printf("%.0f",s);
	}
	
    
	
}