#include <bits/stdc++.h>
// Author: Kazuki_Will_Win_VOI_8703
#define fi first
#define se second
#define pii pair<int, int>
#define ll long long
using namespace std;
const int mn = 5e2 + 5, lg2 = 20, mbit = (1 << 20) + 1, mm = 5e3 + 5;
const double INF = 1e100;
int n, K;
struct Megumi{
int a, b;
bool operator<(const Megumi& other) const{
int bb = (b == -1 ? INT_MAX : b);
int ob = (other.b == -1 ? INT_MAX : other.b);
if(bb == ob) return a < other.a;
return bb < ob;
}
} e[mn];
double dp[mn][mn][mn];
void solve(){
cin >> n >> K;
for(int i = 1; i <= n; i++){
cin >> e[i].a >> e[i].b;
}
sort(e + 1, e + n + 1);
for(int i = 0; i <= n; i++){
for(int j = 0; j <= K; j++){
for(int k = 0; k <= K; k++){
dp[i][j][k] = INF;
}
}
}
dp[0][1][0] = 0;
double ans = INF;
for(int i = 1; i <= n; i++){
for(int j = 1; j <= K; j++){
for(int k = 0; k <= K; k++){
dp[i][j][k] = dp[i - 1][j][k];
if(k >= 1) dp[i][j][k] = min(dp[i][j][k], dp[i - 1][j][k - 1] + (double)e[i].a / (double)j);
if(e[i].b != -1 && j >= 2 && k >= 1) dp[i][j][k] = min(dp[i - 1][j - 1][k - 1] + (double)e[i].b / (double)(j - 1), dp[i][j][k]);
}
}
for(int j = 1; j <= K; j++){
if(dp[i][j][K] < ans) ans = dp[i][j][K];
}
}
cout << setprecision(15) << fixed << ans << '\n';
}
signed main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int t = 1;
// cin >> t;
while(t--){
solve();
}
}
