you give integer n k integer array speed efficiency length n there n engineer number 1 n speedi efficiencyi represent speed efficiency ith engineer respectivelyChoose k different engineer n engineer form team maximum performanceThe performance team sum engineer speed multiplied minimum efficiency engineersreturn maximum performance team since answer huge number return modulo 109 7 Example 1input n 6 speed 2103158 efficiency 543972 k 2output 60explanation we maximum performance team select engineer 2 speed10 efficiency4 engineer 5 speed5 efficiency7 that performance 10 5 min4 7 60example 2input n 6 speed 2103158 efficiency 543972 k 3output 68explanationthis example k 3 we select engineer 1 engineer 2 engineer 5 maximum performance team that performance 2 10 5 min5 4 7 68example 3input n 6 speed 2103158 efficiency 543972 k 4Output 72 Constraints1 k n 105speedlength nefficiencylength n1 speedi 1051 efficiencyi 108