Problem:
Score : 200 points

Problem Statement

A shop sells N kinds of fruits, Fruit 1, \ldots, N, at prices of p_1, \ldots, p_N yen per item, respectively. (Yen is the currency of Japan.)

Here, we will choose K kinds of fruits and buy one of each chosen kind. Find the minimum possible total price of those fruits.

Constraints

1 \leq K \leq N \leq 1000

1 \leq p_i \leq 1000

All values in input are integers.

Input

Input is given from Standard Input in the following format:

N K
p_1 p_2 \ldots p_N

Output

Print an integer representing the minimum possible total price of fruits.

Sample Input 1

5 3
50 100 80 120 80

Sample Output 1

210

This shop sells Fruit 1, 2, 3, 4, and 5 for 50 yen, 100 yen, 80 yen, 120 yen, and 80 yen, respectively.

The minimum total price for three kinds of fruits is 50 + 80 + 80 = 210 yen when choosing Fruit 1, 3, and 5.

Sample Input 2

1 1
1000

Sample Output 2

1000

Solution in C (GCC 9.2.1) (judge verdict: Wrong Answer)

#include <stdio.h>
#include <string.h>

int input[50];
int number,need;
int len;
	

int q_sort(int start, int end){ 
	if(end == start)
		return 0; 
	else{ 
		int p = start;
		for(int i = (start + 1); i < end + 1; i++){ 
			if(input[i] < input[p]){ 
				int temp = input[i]; 
				memmove(input + start + 1, input + start, (i - start)*sizeof(int));
				input[start] = temp;
				p++;
			}
		}
		
		if(start != p)
			q_sort(start,p-1);
			
		if(end != p)  
			q_sort(p+1,end); 
		
		return 0;
	}
}

int main(){
	scanf("%d %d",&number,&need);
	for(int i=0;i<number;i++)
	scanf("%d",&input[i]);
	len = number;
	q_sort(0,len-1);
	int ans=0;
	for(int i=0;i<need;i++)
	ans=ans+input[i];
	printf("%d",ans);
	return 0;
}