#include <bits/stdc++.h>

using namespace std;

typedef long long i64;
typedef unsigned long long u64;
typedef double lf;

int check(vector<int> &a, lf x) {
    int n = (int) a.size();
    vector<lf> b(n + 1);
    b[0] = 0;
    for (int i = 0; i < n; i++) {
        b[i + 1] = b[i] + a[i] - x;
    }

    vector<lf> c;
    for (int i = 0; i <= n; i++) {
        if (b[i] > 0 && b[i] < b.back())
        c.push_back(b[i]);
    }
    b = c;
    n = (int) b.size();
    if (b.empty()) return 0;

    static constexpr lf INF = 1e18;
    vector<lf> d(n + 1, INF);
    d[0] = -INF;

    for (int i = 0; i < n; i++) {
        int l = lower_bound(d.begin(), d.end(), a[i]) - d.begin();
        if (d[l - 1] < a[i] && a[i] < d[l]) {
            d[l] = a[i];
        }
    }

    int ans = 0;
    for (int l = 0; l <= n; l++) {
        if (d[l] < INF)
            ans = l;
    }
    return ans + 1;
}

void solve() {
    int n, k;
    cin >> n >> k;
    vector<int> a(n);
    for (int &x : a) {
        cin >> x;
    }
    lf left = *min_element(a.begin(), a.end()), right = *max_element(a.begin(), a.end());
    while (right - left > 1e-5) {
        lf mid = (left + right) / 2;
        if (check(a, mid) >= k) {
            left = mid;
        } else {
            right = mid;
        }
    }
    cout << fixed << setprecision(10) << left << '\n';
}

signed main() {
#ifndef ONLINE_JUDGE
    freopen("input.txt", "r", stdin);
#endif
    ios_base::sync_with_stdio(false);
    int t = 1;
    // cin >> t;
    for (int i = 0; i < t; i++) {
        solve();
    }
}