#pragma GCC optimize(3, "Ofast", "inline")
#include <iostream>
#include <bits/stdc++.h>
#define IOS ios::sync_with_stdio(false), cin.tie(0), cout.tie(0)
#define INF 0x3f3f3f3f
#define L_INF 0x7f3f3f3f3f3f3f3f
#define db cout << "debug\n";

using namespace std;
const int Mod = 998244353;
using ll = long long;
using ld = long double;
const ld eps = 1e-8;
int n, k;
pair<ld, ld> a[100005];
int check(ld x)
{
    int len = 1;
    vector<ld> b;
    b.push_back(a[1].second - a[1].first * x);
    // cout << b[1] << " " << x << "\n";
    for (int i = 2; i <= n; i++)
    {
        ld cur = a[i].second - a[i].first * x;
        // cout << cur << ' ' << a[i].second << ' ' << a[i].first * x << '\n';
        int pos = upper_bound(b.begin(), b.end(), cur) - b.begin();
        // cout << pos << '\n';
        if (pos == b.size())
        {
            len++;
            b.push_back(cur);
        }
        else
        {
            b[pos] = cur;
        }
    }
    return len >= k;
}
void solve()
{
    cin >> n >> k;
    for (int i = 1; i <= n; i++)
    {
        int x, y;
        cin >> x >> y;
        a[i] = {x, y};
    }
    ld l = -1e9;
    ld r = 1e9;
    // cout << (1 >= eps) << '\n';
    // cout << eps << '\n';
    ld ans = 0;
    while (r - l > eps)
    {
        ld mid = (l + r) / 2.0;
        if (check(mid))
        {
            ans = mid;
            l = mid;
        }
        else
        {
            r = mid;
        }
    }
    // cout << check(0.6) << '\n';
    cout << ans << '\n';
}
int main()
{
    IOS;
    int t = 1;
    // cin >> t;
    while (t--)
    {
        solve();
    }
    return 0;
}