There is a restaurant with a single chef. You are given an array `customers`

, where `customers[i] = [arrival`

_{i}, time_{i}]:

`arrival`

is the arrival time of the_{i}`i`

customer. The arrival times are sorted in^{th}**non-decreasing**order.`time`

is the time needed to prepare the order of the_{i}`i`

customer.^{th}

When a customer arrives, he gives the chef his order, and the chef starts preparing it once he is idle. The customer waits till the chef finishes preparing his order. The chef does not prepare food for more than one customer at a time. The chef prepares food for customers **in the order they were given in the input**.

Return *the average waiting time of all customers*. Solutions within

`10`^{-5}

from the actual answer are considered accepted.

**Example 1:**

Input:customers = [[1,2],[2,5],[4,3]]Output:5.00000Explanation:1) The first customer arrives at time 1, the chef takes his order and starts preparing it immediately at time 1, and finishes at time 3, so the waiting time of the first customer is 3 - 1 = 2. 2) The second customer arrives at time 2, the chef takes his order and starts preparing it at time 3, and finishes at time 8, so the waiting time of the second customer is 8 - 2 = 6. 3) The third customer arrives at time 4, the chef takes his order and starts preparing it at time 8, and finishes at time 11, so the waiting time of the third customer is 11 - 4 = 7. So the average waiting time = (2 + 6 + 7) / 3 = 5.

**Example 2:**

Input:customers = [[5,2],[5,4],[10,3],[20,1]]Output:3.25000Explanation:1) The first customer arrives at time 5, the chef takes his order and starts preparing it immediately at time 5, and finishes at time 7, so the waiting time of the first customer is 7 - 5 = 2. 2) The second customer arrives at time 5, the chef takes his order and starts preparing it at time 7, and finishes at time 11, so the waiting time of the second customer is 11 - 5 = 6. 3) The third customer arrives at time 10, the chef takes his order and starts preparing it at time 11, and finishes at time 14, so the waiting time of the third customer is 14 - 10 = 4. 4) The fourth customer arrives at time 20, the chef takes his order and starts preparing it immediately at time 20, and finishes at time 21, so the waiting time of the fourth customer is 21 - 20 = 1. So the average waiting time = (2 + 6 + 4 + 1) / 4 = 3.25.

**Constraints:**

`1 <= customers.length <= 10`

^{5}`1 <= arrival`

_{i}, time_{i}<= 10^{4}`arrival`

_{i }<= arrival_{i+1}

```
struct Solution;
impl Solution {
fn average_waiting_time(customers: Vec<Vec<i32>>) -> f64 {
let mut chef: f64 = 0.0;
let mut total_wait_time: f64 = 0.0;
let n = customers.len();
for customer in customers {
let arrival = customer[0] as f64;
let time = customer[1] as f64;
let start_time = chef.max(arrival);
let end_time = start_time + time;
chef = end_time;
let wait_time = end_time - arrival;
total_wait_time += wait_time;
}
total_wait_time / n as f64
}
}
#[test]
fn test() {
use assert_approx_eq::assert_approx_eq;
let customers = vec_vec_i32![[1, 2], [2, 5], [4, 3]];
let res = 5.0;
assert_approx_eq!(Solution::average_waiting_time(customers), res);
let customers = vec_vec_i32![[5, 2], [5, 4], [10, 3], [20, 1]];
let res = 3.25000;
assert_approx_eq!(Solution::average_waiting_time(customers), res);
}
```