Function cal

2389-longest-subsequence-with-limited-sum.rs:2–11

(q: i32, sorted_nums: &[i32])

pub fn answer_queries(nums: Vec<i32>, queries: Vec<i32>) -> Vec<i32> {
    fn cal(q: i32, sorted_nums: &[i32]) -> i32 {
        let mut sum = 0;
        for (i, n) in sorted_nums.iter().enumerate() {
            sum += n;
            if sum > q {
                return i as i32
            }
        }
        sorted_nums.len() as i32
    }
    let mut sorted_nums = nums.clone();
    sorted_nums.sort();
    queries.iter().map(|e|cal(*e, &sorted_nums)).collect()