you give positive 0indexed integer array nums1 nums2 length nThe sum square difference array nums1 nums2 define sum nums1i nums2i2 0 nYou give positive integer k1 k2 you modify element nums1 1 1 k1 time similarly modify element nums2 1 1 k2 timesreturn minimum sum square difference modifying array nums1 k1 time modifying array nums2 k2 timesnote you allow modify array element negative integer Example 1input nums1 1234 nums2 2102019 k1 0 k2 0output 579explanation the element nums1 nums2 modify k1 0 k2 0 the sum square difference 1 22 2 102 3 202 4 192 579example 2input nums1 141012 nums2 5869 k1 1 k2 1Output 43explanation one way obtain minimum sum square difference increase nums10 increase nums22 oncethe minimum sum square difference 2 52 4 82 10 72 12 92 43note way obtain minimum sum square difference way obtain sum small 43 Constraintsn nums1length nums2length1 n 1050 nums1i nums2i 1050 k1 k2 109