#pragma region kyomukyomupurin

/**
 *    author  : 𝒌𝒚𝒐𝒎𝒖𝒌𝒚𝒐𝒎𝒖𝒑𝒖𝒓𝒊𝒏
 *    created : 2020-06-22 14:19:38
 **/

#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <chrono>
#include <cmath>
#include <complex>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>

using namespace std;

using int64 = long long;

template<class T>
inline void eraque(std::vector<T>& vec) {
  vec.erase(std::unique(vec.begin(), vec.end()), vec.end());
  return;
}

template<class T>
inline int lower_position(const std::vector<T>& vec, T value) {
  return static_cast<int>(distance(vec.begin(), std::lower_bound(vec.begin(), vec.end(), value)));
}

template<class T>
inline int upper_position(const std::vector<T>& vec, T value) {
  return static_cast<int>(distance(vec.begin(), std::upper_bound(vec.begin(), vec.end(), value)));
}

template <class T>
using binary_heap = std::priority_queue<T, std::vector<T>, std::greater<T>>;

template <class T, class U>
std::ostream& operator<<(std::ostream& os, const std::pair<T, U>& p) {
  return os << '(' << p.first << ", " << p.second << ')';
}

template <class Ch, class Tr, class Tuple, std::size_t... Is>
void tuple_out(std::basic_ostream<Ch, Tr>& os, const Tuple& tp, std::index_sequence<Is...>) {
  ((os << (Is ? ", " : "(") << std::get<Is>(tp)), ...) << ")";
}

template <class Ch, class Tr, class... Args>
auto& operator<<(std::basic_ostream<Ch, Tr>& os, const std::tuple<Args...>& tp) {
  tuple_out(os, tp, std::index_sequence_for<Args...>{});
  return os;
}

template <class T>
std::ostream& operator<<(std::ostream& os, const std::vector<T>& vec) {
  int n = 0;
  for (auto e : vec) os << (n++ ? ", " : "{") << e;
  return os << (n ? "}" : "{}");
}

template <class T, class Compare>
std::ostream& operator<<(std::ostream& os, const std::set<T, Compare>& st) {
  int n = 0;
  for (auto e : st) os << (n++ ? ", " : "{") << e;
  return os << (n ? "}" : "{}");
}

template <class T, class U, class Compare>
std::ostream& operator<<(std::ostream& os, const std::map<T, U, Compare>& mp) {
  int n = 0;
  for (auto e : mp) os << (n++ ? ", " : "{") << e;
  return os << (n ? "}" : "{}");
}

template <class T>
std::istream& operator>>(std::istream& is, std::vector<T>& vec) {
  for (T& e : vec) is >> e;
  return is;
}

template <class T, class U>
std::istream& operator>>(std::istream& is, std::pair<T, U>& p) {
  return is >> p.first >> p.second;
}

template <class Tuple, std::size_t... Is>
void tuple_in(std::istream& is, Tuple& tp, std::index_sequence<Is...>) {
  ((is >> std::get<Is>(tp)), ...);
}

template <class... Args>
std::istream& operator>>(std::istream& is, std::tuple<Args...>& tp) {
  tuple_in(is, tp, std::index_sequence_for<Args...>{});
  return is;
}

#define all(_) begin(_), end(_)
#define rall(_) rbegin(_), rend(_)

#ifdef LOCAL
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]: ", debug_out(__VA_ARGS__)
#else
#define debug(...)
#endif

void debug_out() { std::cerr << '\n'; }

template <class Head, class... Tail>
void debug_out(Head&& head, Tail&&... tail) {
  std::cerr << head;
  if (sizeof...(Tail) != 0) std::cerr << ", ";
  debug_out(std::forward<Tail>(tail)...);
}

#pragma endregion kyomukyomupurin

class Scanner {
  static constexpr int buf = (1 << 27);
  char in[buf], *rb;

 public:
  Scanner() {
    std::fread(in, 1, buf, stdin);
    rb = in;
  }

  template <class Int, std::enable_if_t<std::is_same<Int, int>::value, int> = 0>
  inline void read(Int& num) {
    bool neg = false;
    num = 0;
    while (!std::isdigit(*rb) && *rb != '-') ++rb;
    if (*rb == '-') neg = true, ++rb;
    while (std::isdigit(*rb)) num = (num << 3) + (num << 1) + (*rb - '0'), ++rb;
    if (neg) num = -num;
  }

  template <class Int64,
            std::enable_if_t<std::is_same<Int64, int64>::value, int> = 0>
  inline void read(Int64& num) {
    bool neg = false;
    num = 0;
    while (!std::isdigit(*rb) && *rb != '-') ++rb;
    if (*rb == '-') neg = true, ++rb;
    while (std::isdigit(*rb)) num = (num << 3) + (num << 1) + (*rb - '0'), ++rb;
    if (neg) num = -num;
  }

  template <class String,
            std::enable_if_t<std::is_same<String, std::string>::value, int> = 0>
  inline void read(String& str) {
    while (std::isspace(*rb)) ++rb;
    auto it = rb;
    while (!std::isspace(*rb)) ++rb;
    str = std::string(it, rb);
  }

  template <class Char,
            std::enable_if_t<std::is_same<Char, char>::value, int> = 0>
  inline void read(Char& c) {
    while (std::isspace(*rb)) ++rb;
    c = *rb, ++rb;
  }

  template <class Double,
            std::enable_if_t<std::is_same<Double, double>::value, int> = 0>
  inline void read(Double& num) {
    while (std::isspace(*rb)) ++rb;
    auto it = rb;
    while (!std::isspace(*rb)) ++rb;
    const std::string str = std::string(it, rb);
    num = std::stod(str);
  }

  template <
      class LongDouble,
      std::enable_if_t<std::is_same<LongDouble, long double>::value, int> = 0>
  inline void read(LongDouble& num) {
    while (std::isspace(*rb)) ++rb;
    auto it = rb;
    while (!std::isspace(*rb)) ++rb;
    const std::string str = std::string(it, rb);
    num = std::stold(str);
  }

  template <class Type>
  inline void read(std::vector<Type>& vec) {
    for (Type& e : vec) read(e);
  }

  /*
    void read() {}

    template <class Head, class... Tail>
    inline void read(Head&& head, Tail&&... tail) {
      read(head);
      read(std::forward<Tail>(tail)...);
    }
  */

  template <class Type>
  inline Scanner& operator>>(Type& value) {
    read(value);
    return *this;
  }
};

Scanner sc;

int main() {
  //ios_base::sync_with_stdio(false);
  //cin.tie(nullptr);

  int n, k; sc >> n >> k;
  vector<int> p(n); sc >> p;
  sort(all(p));

  cout << accumulate(p.begin(), p.begin() + k, int()) << endl;

  return 0;
}


Measured memory_bytes: 3612