import java.util.*;
import java.util.ArrayList;
import java.util.Collections;
import java.util.HashMap;
import java.util.TreeMap;
import java.util.ArrayDeque;
import java.awt.Point;
 
class Main{
    public static void main(String[] args){
        
        Scanner sc = new Scanner(System.in);
        
        int N = sc.nextInt();
        int K = sc.nextInt();
        int[] P = new int[N];
        
        for(int i=0; i<N; i++){
            P[i] = sc.nextInt();
        }

        Arrays.sort(P);

        int min = 0;

        for(int i=0; i<K; i++){
            min += P[i];
        }

        System.out.println(min);
    } 
} import java.util.*; util.* java import java.util.ArrayList; ArrayList java.util import java.util.Collections; Collections java.util import java.util.HashMap; HashMap java.util import java.util.TreeMap; TreeMap java.util import java.util.ArrayDeque; ArrayDeque java.util import java.awt.Point; Point java.awt class Main{
    public static void main(String[] args){
        
        Scanner sc = new Scanner(System.in);
        
        int N = sc.nextInt();
        int K = sc.nextInt();
        int[] P = new int[N];
        
        for(int i=0; i<N; i++){
            P[i] = sc.nextInt();
        }

        Arrays.sort(P);

        int min = 0;

        for(int i=0; i<K; i++){
            min += P[i];
        }

        System.out.println(min);
    } 
} Main public static void main(String[] args){
        
        Scanner sc = new Scanner(System.in);
        
        int N = sc.nextInt();
        int K = sc.nextInt();
        int[] P = new int[N];
        
        for(int i=0; i<N; i++){
            P[i] = sc.nextInt();
        }

        Arrays.sort(P);

        int min = 0;

        for(int i=0; i<K; i++){
            min += P[i];
        }

        System.out.println(min);
    } main {
        
        Scanner sc = new Scanner(System.in);
        
        int N = sc.nextInt();
        int K = sc.nextInt();
        int[] P = new int[N];
        
        for(int i=0; i<N; i++){
            P[i] = sc.nextInt();
        }

        Arrays.sort(P);

        int min = 0;

        for(int i=0; i<K; i++){
            min += P[i];
        }

        System.out.println(min);
    } Scanner sc = new Scanner(System.in); sc new Scanner(System.in) int N = sc.nextInt(); N sc.nextInt() sc.nextInt sc int K = sc.nextInt(); K sc.nextInt() sc.nextInt sc int[] P = new int[N]; P new int[N] N for(int i=0; i<N; i++){
            P[i] = sc.nextInt();
        } int i=0; int i=0; i 0 i<N i N i++ i++ i {
            P[i] = sc.nextInt();
        } {
            P[i] = sc.nextInt();
        } P[i] = sc.nextInt() P[i] P i sc.nextInt() sc.nextInt sc Arrays.sort(P) Arrays.sort Arrays P int min = 0; min 0 for(int i=0; i<K; i++){
            min += P[i];
        } int i=0; int i=0; i 0 i<K i K i++ i++ i {
            min += P[i];
        } {
            min += P[i];
        } min += P[i] min P[i] P i System.out.println(min) System.out.println System.out System System.out min String[] args args
import java.util.*;
import java.util.ArrayList;
import java.util.Collections;
import java.util.HashMap;
import java.util.TreeMap;
import java.util.ArrayDeque;
import java.awt.Point;
 
class Main{
    public static void main(String[] args){
        
        Scanner sc = new Scanner(System.in);
        
        int N = sc.nextInt();
        int K = sc.nextInt();
        int[] P = new int[N];
        
        for(int i=0; i<N; i++){
            P[i] = sc.nextInt();
        }

        Arrays.sort(P);

        int min = 0;

        for(int i=0; i<K; i++){
            min += P[i];
        }

        System.out.println(min);
    } 
}