ME

Minimum Cost to Select a Subarray

Given two arrays A and B, and an integer K, find the minimum cost to select a subarray from A that meets the energy requirement of at least K. The cost of selecting a subarray is determined by summing up the corresponding values from B for the same indices.

Example 1:

Input:4 12 7 15 9 18 6 10 8 12

Output:21

Example 2:

Input:4 10 4 10 6 15 5 5 3 9 4 6

Output:20

Example 3:

Input:5 15 1 4 0 10 5 5 9 12 8 9

Output:20

Constraints:

1 <= N <= 10^5 (length of arrays A and B)
1 <= AM, BE <= 10^5 (elements in arrays A and B)
1 <= K <= 10^5 (minimum required sum of elements in the subarray)
It is guaranteed that at least one such subarray exists

solution.cpp

Loading...

Run code to see test results

00:00 / 69:42

Minimum Cost to Select a Subarray

MediumMed•166 views

Given two arrays A and B, and an integer K, find the minimum cost to select a subarray from A that meets the energy requirement of at least K. The cost of selecting a subarray is determined by summing up the corresponding values from B for the same indices.