/*  -*- coding: utf-8 -*-
 *
 * d.cc: D - Project Planning
 */

#include<cstdio>
#include<algorithm>
 
using namespace std;

/* constant */

const int MAX_N = 200000;

/* typedef */

typedef long long ll;

/* global variables */

ll as[MAX_N];

/* subroutines */

bool check(int n, int k, ll x) {
  ll sum = 0;
  for (int i = 0; i < n; i++) sum += min(as[i], x);
  return (sum >= x * k);
}

/* main */

int main() {
  int n, k;
  scanf("%d%d", &n, &k);
  for (int i = 0; i < n; i++) scanf("%lld", as + i);

  ll x0 = *min_element(as, as + n);
  ll x1 = *max_element(as, as + n) + 1;

  while (x0 + 1 < x1) {
    ll x = (x0 + x1) / 2;
    if (check(n, k, x)) x0 = x;
    else x1 = x;
  }

  printf("%lld\n", x0);
  return 0;
}