Question

The task is to find the minimum sum of Products of two arrays of the same size, given that k modifications are allowed on the first array. In each modification, onearray element of the first array can either be increased or decreased by 2. Input Format: First line of the input contains n and k delimited by whitespace.​

Answer 1

Answer:

wkfhdnlsdudblspehfndmspshdbspdhdblapwhfbdlapwhfnslwudbdmwphrbxlaodbfmspehfbd koi rvndoevfnslehdnlwpehdzpw he nxalpdfhnzowhfndoebfmsifbspoebfls if bdlqprubfnzpehdnpe hmm