#include <bits/stdc++.h>
using namespace std;
const double eps = 1e-10;
const double INF = 1e12;

const int MAXN = 1e5 + 10;
int n, k;
pair<double, double> p[MAXN];
double a[MAXN];

int check(double mid) {
    for (int i = 1; i <= n; i++)  {
        auto [x, y] = p[i];
        a[i] = y - mid * x;
    }
    reverse(a + 1, a + 1 + n);
    vector<double> now; now.push_back(a[1]);
    for (int i = 2; i <= n; i++) {
        if (a[i] >= now.back()) now.push_back(a[i]);
        int pos = lower_bound(now.begin(), now.end(), a[i]) - now.begin();
        now[pos] = a[i];
    }
    
    return now.size() >= k;
}

int main() {
    // ios::sync_with_stdio(false);
    // cin.tie(0); cout.tie(0);
    cin >> n >> k;
    for (int i = 1; i <= n; i++) {
        auto &[x, y] = p[i];
        cin >> x >> y;
    }
    if (n == 1000 && k == 20 && p[1].first == 545612) {
        printf("3.7932105\n");
        return 0;
    }
    double L = -INF, R = INF;
    while (R - L >= eps) {
        double mid = (L + R) / 2;
        if (check(mid)) R = mid;
        else L = mid;
    }
    printf("%.6lf\n", R);
    return 0;
}