Some inputs perform better picking one of the next best rides

instead of picking the next best ride according to our score
function

With the few performing better, total score is now past 48M.

main.go

@@ -133,17 +133,19 @@ func max(a, b int) int {
 }
 
 func Choose(c *Car) *Ride {
-	var bestRide *Ride
-	bestLenOfRide := 0
-	bestTotal := 0
+	var bestRides []struct {
+		r         *Ride
+		lenOfRide int
+		total     int
+	}
 	// fmt.Printf("car %d\n", c.ID)
 	for _, r := range Rides {
 		if r.used {
 			continue
 		}
-		if r.Length() > 6000 {
-			continue
-		}
+		// if r.Length() > 6000 {
+		// 	continue
+		// }
 		if r.f < c.EarliestFinish(r) {
 			continue
 		}
@@ -151,16 +153,30 @@ func Choose(c *Car) *Ride {
 		lenOfRide := r.length()
 		total := max(c.distanceTo(r.a, r.b), r.s-c.Arrival) + lenOfRide
 		// fmt.Printf("%d/%d\n", lenOfRide, total)
-		if bestRide == nil || lenOfRide*bestTotal > total*bestLenOfRide {
-			bestLenOfRide = lenOfRide
-			bestTotal = total
-			bestRide = r
+		if len(bestRides) == 0 || lenOfRide*bestRides[len(bestRides)-1].total > total*bestRides[len(bestRides)-1].lenOfRide {
+			bestRides = append(bestRides, struct {
+				r         *Ride
+				lenOfRide int
+				total     int
+			}{r, lenOfRide, total})
+			// shitty sort-of-correct-but-quite-incorrect way
+			// of picking next best n rides
+			n := 3
+			if len(bestRides) > n {
+				bestRides = bestRides[len(bestRides)-n:]
+			}
 		}
 	}
 	// if bestRide != nil {
 	// 	fmt.Printf("Picking %d %d -> %d %d\n", bestRide.a, bestRide.b, bestRide.x, bestRide.y)
 	// }
-	return bestRide
+	if len(bestRides) != 0 {
+		// pick the not quite best ride...hey some
+		// of the inputs already  give a better score !
+		return bestRides[0].r
+		//return bestRides[len(bestRides)-1].r
+	}
+	return nil
 }
 
 func assign() bool {