3962. Maximum Subarray Sum After at Most K Swaps

You are given an integer array nums and an integer k. You are allowed to perform at most k swap operations on the array. In one swap operation, you may choose any two indices i and j and swap nums[i] and nums[j]. Return an integer denoting the maximum possible subarray sum after performing the swaps. Example 1: Input: nums = [1,-1,0,2], k = 1 Output: 3 Explanation: - We can swap on indic