can any one post a mathematical prove?


  • 0

    If we sort this array,we got a new array, say X, then it seems that:
    sum=X[0]+X[2]+X[4]+...X[2n-2]
    is the max result of these n pair for each min(ai,bi)

    but can any one give a prove?


Log in to reply
 

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.