You are given integer arrays b and g of equal length n and a positive integer k. You must choose a subsequence of indices from nums1 of length k.
For chosen indices i1, i2, ..., ik, your score is defined as:
The sum of the selected elements from nums1 multiplied with the minimum of the selected elements from nums2. It can be defined simply as: (b[i1] + b[i2] +...+ b[ik]) * min(g[i1], g[i2], ... ,g[ik]). Return the maximum possible score.
A subsequence of indices of an array is a set that can be derived from the set {1, 2, ..., n} by deleting some or no elements.