// author : anhtun_hi , nqg
#include <bits/stdc++.h>
#define ll long long
#define ii pair<ll, ll>
#define fi first
#define se second
#define all(x) x.begin(), x.end()
#define reset(h, v) memset(h, v, sizeof h)
#define Forv(i, a) for(auto& i : a)
#define For(i, a, b) for(int i = a; i <= b; ++i)
#define Ford(i, a, b) for(int i = a; i >= b; --i)
#define c_bit(i) __builtin_popcountll(i)
#define Bit(mask, i) ((mask >> i) & 1LL)
#define onbit(mask, i) ((mask) bitor (1LL << i))
#define offbit(mask, i) ((mask) &~ (1LL << i))
#define Log2(x) (63 - __builtin_clzll(x))
#define TIME (1.0 * clock() / CLOCKS_PER_SEC)
using namespace std;
namespace std {
template <typename T, int D>
struct _vector : public vector <_vector <T, D - 1>> {
static_assert(D >= 1, "Dimension must be positive!");
template <typename... Args>
_vector(int n = 0, Args... args) : vector <_vector <T, D - 1>> (n, _vector <T, D - 1> (args...)) {}
};
template <typename T> struct _vector <T, 1> : public vector <T> {
_vector(int n = 0, const T& val = T()) : vector <T> (n, val) {}
};
template <class A, class B> bool minimize(A &a, B b){return a > b ? a = b, true : false;}
template <class A, class B> bool maximize(A &a, B b){return a < b ? a = b, true : false;}
}
const int dx[] = {0, 0, +1, -1}, dy[] = {-1, +1, 0, 0}, LOG = 20, base = 311, inf = 1e9 + 5;
const int MAXN = 1e2 + 5;
const ll mod = 1e9 + 7;
const ll oo = 1e18;
//#define int long long
int n, k;
#define db long double
int a[MAXN], b[MAXN];
namespace subtrau{
db dp[MAXN][MAXN][MAXN];
void Solve(){
For(i, 0, n + 1) For(j, 0, n + 1) For(cc, 0, n + 1) dp[i][j][cc] = oo;
dp[0][0][0] = 0;
For(loops, 1, n) For(i, 0, k) For(j, 0, n){
minimize(dp[loops][i][j], dp[loops - 1][i][j]);
db _j = j;
if (i) minimize(dp[loops][i][j], dp[loops - 1][i - 1][j] + 1.0*(a[loops] / (_j + 1)));
// if (loops==2&&i==2&&j==0) cerr << dp[2][2][0] << '\n';
if (b[loops] != inf && i){
minimize(dp[loops][i][j], dp[loops - 1][i - 1][j - 1] + 1.0*(b[loops] / _j));
}
}
db ans = oo;
For(cc, 1, n) For(j, 0, n) minimize(ans, dp[cc][k][j]);
For(i, 0, n + 1) For(j, 0, n + 1) For(cc, 0, n + 1) dp[i][j][cc] = oo;
dp[n + 1][0][0] = 0;
Ford(loops, n, 1) For(i, 0, k) For(j, 0, n){
minimize(dp[loops][i][j], dp[loops + 1][i][j]);
db _j = j;
if (i) minimize(dp[loops][i][j], dp[loops + 1][i - 1][j] + 1.0*(a[loops] / (_j + 1)));
if (b[loops] != inf && i){
minimize(dp[loops][i][j], dp[loops + 1][i - 1][j - 1] + 1.0*(b[loops] / _j));
}
}
For(cc, 1, n) For(j, 0, n) minimize(ans, dp[cc][k][j]);
cout << setprecision(15) << fixed << ans << '\n';
}
}
void Solve() {
cin >> n >> k;
For(i, 1, n) {
cin >> a[i] >> b[i];
if(b[i] == -1) b[i] = inf;
}
subtrau::Solve();
}
signed main() {
cin.tie(0) -> sync_with_stdio(0);
if(fopen("lat.inp", "r")) {
freopen("lat.inp", "r", stdin);
freopen("lat.out", "w", stdout);
}
int t = 1;
// cin >> t;
while(t --) Solve();
return 0;
}
