Add problem 2895: Minimum Processing Time

Author: EFanZh

src/lib.rs

@@ -2002,6 +2002,7 @@ pub mod problem_2871_split_array_into_maximum_number_of_subarrays;
 pub mod problem_2873_maximum_value_of_an_ordered_triplet_i;
 pub mod problem_2874_maximum_value_of_an_ordered_triplet_ii;
 pub mod problem_2894_divisible_and_non_divisible_sums_difference;
+pub mod problem_2895_minimum_processing_time;
 
 #[cfg(test)]
 mod test_utilities;

src/problem_2895_minimum_processing_time/greedy.rs

@@ -0,0 +1,36 @@
+pub struct Solution;
+
+// ------------------------------------------------------ snip ------------------------------------------------------ //
+
+impl Solution {
+    pub fn min_processing_time(processor_time: Vec<i32>, tasks: Vec<i32>) -> i32 {
+        let mut processor_time = processor_time;
+        let mut tasks = tasks;
+
+        processor_time.sort_unstable();
+        tasks.sort_unstable();
+
+        processor_time
+            .iter()
+            .zip(tasks.iter().rev().step_by(4))
+            .fold(0, |max, (processor_time, task)| {
+                u32::max(max, (processor_time + task) as _)
+            }) as _
+    }
+}
+
+// ------------------------------------------------------ snip ------------------------------------------------------ //
+
+impl super::Solution for Solution {
+    fn min_processing_time(processor_time: Vec<i32>, tasks: Vec<i32>) -> i32 {
+        Self::min_processing_time(processor_time, tasks)
+    }
+}
+
+#[cfg(test)]
+mod tests {
+    #[test]
+    fn test_solution() {
+        super::super::tests::run::<super::Solution>();
+    }
+}

src/problem_2895_minimum_processing_time/mod.rs

@@ -0,0 +1,24 @@
+pub mod greedy;
+
+pub trait Solution {
+    fn min_processing_time(processor_time: Vec<i32>, tasks: Vec<i32>) -> i32;
+}
+
+#[cfg(test)]
+mod tests {
+    use super::Solution;
+
+    pub fn run<S: Solution>() {
+        let test_cases = [
+            ((&[8, 10] as &[_], &[2, 2, 3, 1, 8, 7, 4, 5] as &[_]), 16),
+            ((&[10, 20], &[2, 3, 1, 2, 5, 8, 4, 3]), 23),
+        ];
+
+        for ((processor_time, tasks), expected) in test_cases {
+            assert_eq!(
+                S::min_processing_time(processor_time.to_vec(), tasks.to_vec()),
+                expected,
+            );
+        }
+    }
+}