//Make CSP great again
//Vengeance
#include <bits/stdc++.h>
#define TASK "TESTCODE"
using namespace std;
const int N = 1e5;
pair<int, int> a[N + 1];
int n, k;
int id[N + 1], e[N + 1];
void read()
{
    cin >> n >> k;
    for (int i = 1; i <= n; ++ i)
    {
        cin >> a[i].first >> a[i].second;
        id[i] = i;
    }
}
bool check(long double mid)
{
    sort(id + 1, id + n + 1, [&] (const int &i, const int &j)
    {
        return (long double)(a[i].second) - mid * a[i].first > (long double)(a[j].second) - mid * a[j].first;
    });
    for (int i = 1; i <= n; ++ i)
    {
        e[i] = 1e9;
        int j = lower_bound(e + 1, e + i + 1, id[i]) - e;
        if (j >= k)
        {
            return true;
        }
        e[j] = id[i];
    }
    return false;
}
void solve()
{
    sort(a + 1, a + n + 1);
    long double low = -1e9, high = 1e9;
    for (int t = 1; t <= 64; ++ t)
    {
        long double mid = (low + high)/2;
        if (check(mid))
        {
            high = mid;
        }
        else 
        {
            low = mid;
        }
    }
    cout << fixed << setprecision(6) << low;
}
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    if (fopen(TASK".INP", "r"))
    {
        freopen(TASK".INP", "r", stdin);
        //freopen(TASK".OUT", "w", stdout);
    }
    int t = 1;
    bool typetest = false;
    if (typetest)
    {
        cin >> t;
    }
    for (int __ = 1; __ <= t; ++ __)
    {
        //cout << "Case " << __ << ": ";
        read();
        solve();
    }
}