# Arup Guha
# 4/18/2025
# Solution to COP 4516 Team Contest Problem: Need for Speed

# Get the total drive time if the spedometer offset is offset.
def getTime(segs, offset):

    # Just add up times for each segment.
    t = 0
    for seg in segs:
        t += seg[0]/(seg[1]+offset)

    # Ta da!
    return t

def main():

    # Get basic input.
    toks = input().split()
    n = int(toks[0])
    t = int(toks[1])

    # Will store the minimum spedometer reading so far.
    minSoFar = 1001

    # Get segment data.
    segs = []
    for i in range(n):
        vals = [int(x) for x in input().split()]
        minSoFar = min(minSoFar, vals[1])
        segs.append(vals)

    # Valid bounds for binary search.
    low = -minSoFar
    high = 2000000

    # For real valued binary searc.
    for i in range(100):

        # Try this setting.
        mid = (low+high)/2

        # Too slow, so lowest answer could be is mid.
        if getTime(segs, mid) > t:
            low = mid

        # Too fast, highest answer could be is mid.
        else:
            high = mid

    # Ta da!
    print(low)

# Run it.
main()