ShaysXIA/CodeInsightBench huggingface dataset:
Problem: 2063B - Subsequence Update
Language: python

Solution 1 (runtime: 140 ms):
def get_num_cases():
    return int(input())


def get_line():
    return [int(p) for p in input().strip().split()]



from itertools import accumulate
import sys


class ArraySum:

    def __init__(self, arr):
        self.sums = []
        s = 0
        for n in arr:
            s += n
            self.sums.append(s)

    def get(self, i, j):  # 0 based
        if i > j:
            return 0
        if i == 0:
            return self.sums[j]
        return self.sums[j] - self.sums[i-1]


    def get_min(self, i, j, n):  # 0 based
        if n == 0:
            return 0
        if n > (j - i + 1):
            return float('inf')
        return min(
            self.get(p, p + n - 1)
            for p in range(i, j - n + 2)
        )

    def __len__(self):
        return len(self.sums)


for _ in range(get_num_cases()):
    n, l, r = get_line()
    l -= 1
    arr = get_line()
    brr=arr[:l]+sorted(arr[l:])
    crr=sorted(arr[:r])[::-1]+arr[r:]
    print(min(sum(brr[l:r]),sum(crr[l:r])))






Solution 2 (runtime: 390 ms):
for _ in range(int(input())):
    n, l, r = map(int, input().split(' '))
    a = list(map(int, input().split(' ')))
    
    lst1 = sorted(a[0:l - 1])
    lst2 = sorted(a[l - 1:r], reverse = True)
    if r < n:
        lst3 = sorted(a[r:])
    else:
        lst3 = []
    
    res = sum(lst2)
    for i in range(min(len(lst1), len(lst2))):
        if lst1[i] < lst2[i]:
            res += (lst1[i] - lst2[i])
        else:
            break
    
    res1 = sum(lst2)
    for i in range(min(len(lst3), len(lst2))):
        if lst3[i] < lst2[i]:
            res1 += (lst3[i] - lst2[i])
        else:
            break
    
    print(min(res, res1))
Problem: 2063B - Subsequence Update
Language: python

Solution 1 (runtime: 140 ms):
def get_num_cases():
    return int(input())


def get_line():
    return [int(p) for p in input().strip().split()]



from itertools import accumulate
import sys


class ArraySum:

    def __init__(self, arr):
        self.sums = []
        s = 0
        for n in arr:
            s += n
            self.sums.append(s)

    def get(self, i, j):  # 0 based
        if i > j:
            return 0
        if i == 0:
            return self.sums[j]
        return self.sums[j] - self.sums[i-1]


    def get_min(self, i, j, n):  # 0 based
        if n == 0:
            return 0
        if n > (j - i + 1):
            return float('inf')
        return min(
            self.get(p, p + n - 1)
            for p in range(i, j - n + 2)
        )

    def __len__(self):
        return len(self.sums)


for _ in range(get_num_cases()):
    n, l, r = get_line()
    l -= 1
    arr = get_line()
    brr=arr[:l]+sorted(arr[l:])
    crr=sorted(arr[:r])[::-1]+arr[r:]
    print(min(sum(brr[l:r]),sum(crr[l:r])))






Solution 2 (runtime: 358 ms):
from collections import defaultdict, Counter
from random import randint
def intlist(): return list(map(int, (x for x in input().split())))


def check(mid, portion):
    mid = sorted(mid)[::-1]
    portion.sort()
    su = 0
    len_mid = len(mid)
    len_portion = len(portion)
    i, j = 0, 0
    while j < len_mid and i < len_portion:
        if mid[j] <= portion[i]:
            break 
        su += portion[i]
        i += 1
        j += 1
    while j < len_mid:
        su += mid[j]
        j += 1
    return su


for _ in range(int(input())):
    n, l, r = intlist()
    nums = intlist()
    first = nums[:l-1]
    mid = nums[l-1:r]
    last = nums[r:]
    print(min(check(mid, first), check(mid, last)))
Problem: 2063B - Subsequence Update
Language: python

Solution 1 (runtime: 140 ms):
def get_num_cases():
    return int(input())


def get_line():
    return [int(p) for p in input().strip().split()]



from itertools import accumulate
import sys


class ArraySum:

    def __init__(self, arr):
        self.sums = []
        s = 0
        for n in arr:
            s += n
            self.sums.append(s)

    def get(self, i, j):  # 0 based
        if i > j:
            return 0
        if i == 0:
            return self.sums[j]
        return self.sums[j] - self.sums[i-1]


    def get_min(self, i, j, n):  # 0 based
        if n == 0:
            return 0
        if n > (j - i + 1):
            return float('inf')
        return min(
            self.get(p, p + n - 1)
            for p in range(i, j - n + 2)
        )

    def __len__(self):
        return len(self.sums)


for _ in range(get_num_cases()):
    n, l, r = get_line()
    l -= 1
    arr = get_line()
    brr=arr[:l]+sorted(arr[l:])
    crr=sorted(arr[:r])[::-1]+arr[r:]
    print(min(sum(brr[l:r]),sum(crr[l:r])))






Solution 2 (runtime: 139 ms):
t=int(input())

for _ in range(t):

    n,l,r=map(int,input().split())

    a=list(map(int,input().split()))

    l=l-1

    r=r-1

    l1=a[:r+1]

    l2=a[l:]

    l1.sort()

    l2.sort()

    print(min(sum(l1[:r-l+1]),sum(l2[:r-l+1])))
Problem: 2063B - Subsequence Update
Language: python

Solution 1 (runtime: 140 ms):
def get_num_cases():
    return int(input())


def get_line():
    return [int(p) for p in input().strip().split()]



from itertools import accumulate
import sys


class ArraySum:

    def __init__(self, arr):
        self.sums = []
        s = 0
        for n in arr:
            s += n
            self.sums.append(s)

    def get(self, i, j):  # 0 based
        if i > j:
            return 0
        if i == 0:
            return self.sums[j]
        return self.sums[j] - self.sums[i-1]


    def get_min(self, i, j, n):  # 0 based
        if n == 0:
            return 0
        if n > (j - i + 1):
            return float('inf')
        return min(
            self.get(p, p + n - 1)
            for p in range(i, j - n + 2)
        )

    def __len__(self):
        return len(self.sums)


for _ in range(get_num_cases()):
    n, l, r = get_line()
    l -= 1
    arr = get_line()
    brr=arr[:l]+sorted(arr[l:])
    crr=sorted(arr[:r])[::-1]+arr[r:]
    print(min(sum(brr[l:r]),sum(crr[l:r])))






Solution 2 (runtime: 156 ms):
t = int(input())

 

for i in range(t):

    [n, l, r] = [int(val) for val in input().split()]

    nums = [int(val) for val in input().split()]

    nums_one = [int(val) for val in nums[:r]]

    nums_two = [int(val) for val in nums[l-1:]]

    nums_one.sort()

    nums_two.sort()

    print(min(sum(nums_one[:r-l+1]), sum(nums_two[:r-l+1])))

    # ret = 0

    # for j in range(r-l+1):

    #     ret_one += nums[j]

    # print(ret)
Problem: 2063B - Subsequence Update
Language: python

Solution 1 (runtime: 140 ms):
def get_num_cases():
    return int(input())


def get_line():
    return [int(p) for p in input().strip().split()]



from itertools import accumulate
import sys


class ArraySum:

    def __init__(self, arr):
        self.sums = []
        s = 0
        for n in arr:
            s += n
            self.sums.append(s)

    def get(self, i, j):  # 0 based
        if i > j:
            return 0
        if i == 0:
            return self.sums[j]
        return self.sums[j] - self.sums[i-1]


    def get_min(self, i, j, n):  # 0 based
        if n == 0:
            return 0
        if n > (j - i + 1):
            return float('inf')
        return min(
            self.get(p, p + n - 1)
            for p in range(i, j - n + 2)
        )

    def __len__(self):
        return len(self.sums)


for _ in range(get_num_cases()):
    n, l, r = get_line()
    l -= 1
    arr = get_line()
    brr=arr[:l]+sorted(arr[l:])
    crr=sorted(arr[:r])[::-1]+arr[r:]
    print(min(sum(brr[l:r]),sum(crr[l:r])))






Solution 2 (runtime: 343 ms):
import math

from collections import deque, defaultdict, Counter

import heapq



def solution():

  n, l ,r = list(map(int, input().split(" ")))

  l -= 1

  r -= 1

  a = list(map(int, input().split(" ")))

  segment = a[l:r+1]

  res = sum(segment)

  left, right = a[:l], a[r+1:]

  segment.sort()

  left.sort()

  right.sort()

  i, j = 0, len(segment) - 1

  while i < len(left) and j >= 0:

    if left[i] < segment[j]:

      segment[j] = left[i]

      i += 1

      j -= 1

    else:

      break

  res = min(res, sum(segment))

  segment = a[l:r+1]

  segment.sort()

  i, j = 0, len(segment) - 1

  while i < (len(right)) and j >= 0:

    if right[i] < segment[j]:

      segment[j] = right[i]

      i += 1

      j -= 1

    else:

      break

  res = min(res, sum(segment))

  return res





t = int(input())

for i in range(t):

  print(solution())
Problem: 2063B - Subsequence Update
Language: python

Solution 1 (runtime: 140 ms):
def get_num_cases():
    return int(input())


def get_line():
    return [int(p) for p in input().strip().split()]



from itertools import accumulate
import sys


class ArraySum:

    def __init__(self, arr):
        self.sums = []
        s = 0
        for n in arr:
            s += n
            self.sums.append(s)

    def get(self, i, j):  # 0 based
        if i > j:
            return 0
        if i == 0:
            return self.sums[j]
        return self.sums[j] - self.sums[i-1]


    def get_min(self, i, j, n):  # 0 based
        if n == 0:
            return 0
        if n > (j - i + 1):
            return float('inf')
        return min(
            self.get(p, p + n - 1)
            for p in range(i, j - n + 2)
        )

    def __len__(self):
        return len(self.sums)


for _ in range(get_num_cases()):
    n, l, r = get_line()
    l -= 1
    arr = get_line()
    brr=arr[:l]+sorted(arr[l:])
    crr=sorted(arr[:r])[::-1]+arr[r:]
    print(min(sum(brr[l:r]),sum(crr[l:r])))






Solution 2 (runtime: 171 ms):
t = int(input())

for _ in range(t):

    n,l,r = map(int,input().split())

    arr = list(map(int,input().split()))

   



    l-=1

    brr=arr[:l]+sorted(arr[l:])

    crr=sorted(arr[:r])[::-1]+arr[r:]

    print(min(sum(brr[l:r]),sum(crr[l:r])))
Problem: 2063B - Subsequence Update
Language: python

Solution 1 (runtime: 140 ms):
def get_num_cases():
    return int(input())


def get_line():
    return [int(p) for p in input().strip().split()]



from itertools import accumulate
import sys


class ArraySum:

    def __init__(self, arr):
        self.sums = []
        s = 0
        for n in arr:
            s += n
            self.sums.append(s)

    def get(self, i, j):  # 0 based
        if i > j:
            return 0
        if i == 0:
            return self.sums[j]
        return self.sums[j] - self.sums[i-1]


    def get_min(self, i, j, n):  # 0 based
        if n == 0:
            return 0
        if n > (j - i + 1):
            return float('inf')
        return min(
            self.get(p, p + n - 1)
            for p in range(i, j - n + 2)
        )

    def __len__(self):
        return len(self.sums)


for _ in range(get_num_cases()):
    n, l, r = get_line()
    l -= 1
    arr = get_line()
    brr=arr[:l]+sorted(arr[l:])
    crr=sorted(arr[:r])[::-1]+arr[r:]
    print(min(sum(brr[l:r]),sum(crr[l:r])))






Solution 2 (runtime: 265 ms):
for _ in range(int(input())):

    n,l,r=map(int,input().split())

    arra=list(map(int,input().split()))

    arra1=arra[:r]

    arra2=arra[l-1:]

    sum1=0

    sum2=0

    arra1.sort()

    arra2.sort()

    for i in range(r-l+1):

        sum1+=arra1[i]

    for i in range(r-l+1):

        sum2+=arra2[i]

    print(min(sum1,sum2))
Problem: 2063B - Subsequence Update
Language: python

Solution 1 (runtime: 155 ms):
t = int(input())
for _ in range(t):
    n, l, r = map(int, input().split())
    a = list(map(int, input().split()))
    s = sorted(a[l - 1:r], reverse=True)
    before = sorted(a[:l - 1])
    after = sorted(a[r:n])
    ans1 = 0
    ans2 = 0
    for i in range(len(s)):
        if len(before) > i:
            ans1 += min(before[i], s[i])
        else:
            ans1 += s[i]
        if len(after) > i:
            ans2 += min(after[i], s[i])
        else:
            ans2 += s[i]
    print(min(ans1, ans2))


Solution 2 (runtime: 140 ms):
import sys
lines = sys.stdin.read().splitlines()
t = int(lines[0])

for i in range(1, t + 1):
    n,l,r = list(map(int,lines[2 * i - 1].split()))
    nums = list(map(int,lines[2 * i].split()))
    l -= 1
    r -= 1
    arr1 = nums[:r + 1]
    arr1.sort()
    summ1 = 0
    for j in range(r - l + 1):
        summ1 += arr1[j]
    arr2 = nums[l:]
    arr2.sort()
    summ2 = 0
    for j in range(r - l + 1):
        summ2 += arr2[j]
    print(min(summ1,summ2))
Problem: 2063B - Subsequence Update
Language: python

Solution 1 (runtime: 155 ms):
t = int(input())
for _ in range(t):
    n, l, r = map(int, input().split())
    a = list(map(int, input().split()))
    s = sorted(a[l - 1:r], reverse=True)
    before = sorted(a[:l - 1])
    after = sorted(a[r:n])
    ans1 = 0
    ans2 = 0
    for i in range(len(s)):
        if len(before) > i:
            ans1 += min(before[i], s[i])
        else:
            ans1 += s[i]
        if len(after) > i:
            ans2 += min(after[i], s[i])
        else:
            ans2 += s[i]
    print(min(ans1, ans2))


Solution 2 (runtime: 296 ms):
import sys
import math
import collections
import statistics
import bisect

############ ---- Input Functions ---- ############
##---1) inp — For taking integer inputs.
def inp():
    return (int(input()))

##2) inlt — For taking List inputs.
def inlt():
    return (list(map(int, input().split())))

#3) insr — For taking string inputs. Actually it returns a List of Characters,
# instead of a string, which is easier to use in Python, because in Python,
# Strings are Immutable.
def insr():
    s = input()
    return (list(s[:len(s) - 1]))

#4) invr — For taking space seperated integer variable inputs.
def invr():
    return list(map(int, input().split()))

# freq = collections.defaultdict(int)
# print(''.join(n))
MAX = int(2e5) + 7


def solve():
    n ,l ,r = inlt()
    a = inlt()
    # a.sort()
    sumf = 0
    sums = 0
    diff = r - l + 1
    firstcase = a[:r]
    secondcase = a[l-1:]
    firstcase.sort()
    secondcase.sort()
    for i in range(diff):
        sumf += firstcase[i]
        sums += secondcase[i]
    print(min(sumf, sums))

t = int(input())
for _ in range(t):
    solve()
Problem: 2063B - Subsequence Update
Language: python

Solution 1 (runtime: 155 ms):
t = int(input())
for _ in range(t):
    n, l, r = map(int, input().split())
    a = list(map(int, input().split()))
    s = sorted(a[l - 1:r], reverse=True)
    before = sorted(a[:l - 1])
    after = sorted(a[r:n])
    ans1 = 0
    ans2 = 0
    for i in range(len(s)):
        if len(before) > i:
            ans1 += min(before[i], s[i])
        else:
            ans1 += s[i]
        if len(after) > i:
            ans2 += min(after[i], s[i])
        else:
            ans2 += s[i]
    print(min(ans1, ans2))


Solution 2 (runtime: 281 ms):
from collections import Counter
import sys
 
# sys.set_int_max_str_digits(200000)
import heapq
import math
from collections import defaultdict
# import sys
# sys.setrecursionlimit(100000)
mod=10**9+7
t = int(input())
for _ in range(t):
    n,l,r=map(int,input().split())
    arr=list(map(int,input().split()))
    brr=arr[:l-1]+sorted(arr[l-1:])
    crr=sorted(arr[:r])[::-1]+arr[r:]
    print(min(sum(brr[l-1:r]),sum(crr[l-1:r])))
Problem: 2063B - Subsequence Update
Language: python

Solution 1 (runtime: 155 ms):
t = int(input())
for _ in range(t):
    n, l, r = map(int, input().split())
    a = list(map(int, input().split()))
    s = sorted(a[l - 1:r], reverse=True)
    before = sorted(a[:l - 1])
    after = sorted(a[r:n])
    ans1 = 0
    ans2 = 0
    for i in range(len(s)):
        if len(before) > i:
            ans1 += min(before[i], s[i])
        else:
            ans1 += s[i]
        if len(after) > i:
            ans2 += min(after[i], s[i])
        else:
            ans2 += s[i]
    print(min(ans1, ans2))


Solution 2 (runtime: 156 ms):
import sys

input=lambda:sys.stdin.readline().rstrip()

 

for _ in range(int(input())):

    n,l,r=map(int,input().split());l-=1

    arr=[*map(int,input().split())]

    brr=arr[:l]+sorted(arr[l:])

    crr=sorted(arr[:r])[::-1]+arr[r:]

    print(min(sum(brr[l:r]),sum(crr[l:r])))
Problem: 2063B - Subsequence Update
Language: python

Solution 1 (runtime: 155 ms):
t = int(input())
for _ in range(t):
    n, l, r = map(int, input().split())
    a = list(map(int, input().split()))
    s = sorted(a[l - 1:r], reverse=True)
    before = sorted(a[:l - 1])
    after = sorted(a[r:n])
    ans1 = 0
    ans2 = 0
    for i in range(len(s)):
        if len(before) > i:
            ans1 += min(before[i], s[i])
        else:
            ans1 += s[i]
        if len(after) > i:
            ans2 += min(after[i], s[i])
        else:
            ans2 += s[i]
    print(min(ans1, ans2))


Solution 2 (runtime: 156 ms):
test = int(input())
for _ in range(test):
    n, l, r = map(int, input().split())
    a = list(map(int, input().split()))
   
    left_sorted = sorted(a[:r])
    right_sorted = sorted(a[l-1:])
    sum_1 = sum(left_sorted[:r-l+1])
    sum_2 = sum(right_sorted[:r-l+1])
    print(min(sum_1, sum_2))
    # ans = 0
    # for i in range(r-l+1):
    #     ans += a[i]
    # print(ans)
Problem: 2063B - Subsequence Update
Language: python

Solution 1 (runtime: 155 ms):
t = int(input())
for _ in range(t):
    n, l, r = map(int, input().split())
    a = list(map(int, input().split()))
    s = sorted(a[l - 1:r], reverse=True)
    before = sorted(a[:l - 1])
    after = sorted(a[r:n])
    ans1 = 0
    ans2 = 0
    for i in range(len(s)):
        if len(before) > i:
            ans1 += min(before[i], s[i])
        else:
            ans1 += s[i]
        if len(after) > i:
            ans2 += min(after[i], s[i])
        else:
            ans2 += s[i]
    print(min(ans1, ans2))


Solution 2 (runtime: 155 ms):
t=int(input())

for i in range(t):
    n,l,r=list(map(int,input().split()))
    l-=1
    a=list(map(int,input().split()))
    b=a[:l]+sorted(a[l:])
    c=sorted(a[:r])[::-1]+a[r:]
    print(min(sum(c[l:r]),sum(b[l:r])))
Problem: 2063B - Subsequence Update
Language: python

Solution 1 (runtime: 155 ms):
t = int(input())
for _ in range(t):
    n, l, r = map(int, input().split())
    a = list(map(int, input().split()))
    s = sorted(a[l - 1:r], reverse=True)
    before = sorted(a[:l - 1])
    after = sorted(a[r:n])
    ans1 = 0
    ans2 = 0
    for i in range(len(s)):
        if len(before) > i:
            ans1 += min(before[i], s[i])
        else:
            ans1 += s[i]
        if len(after) > i:
            ans2 += min(after[i], s[i])
        else:
            ans2 += s[i]
    print(min(ans1, ans2))


Solution 2 (runtime: 202 ms):
import sys

inp = sys.stdin.readline

def I(): return int(inp().strip())

def IS(): return inp().strip()

def II(): return map(int, inp().split())

def IL(): return list(map(int, inp().split()))

def SIL(): return sorted(map(int, inp().split()))

from collections import defaultdict, Counter, deque

from array import array

from math import gcd

















def solve():

    n, l, r = II()

    arr = IL()



    left = (arr[:l-1])

    right =(arr[r:])

    segment = (arr[l-1:r])

    



    



    ans1 = sorted(left + segment)[:r-l+1]

    ans2 = sorted(right + segment)[:r-l+1]





    if sum(ans1) < sum(ans2):

        print(sum(ans1))

    else:

        print(sum(ans2))



   

   

T = I()

for _ in range(T):

    solve()
Problem: 2063B - Subsequence Update
Language: python

Solution 1 (runtime: 155 ms):
t = int(input())
for _ in range(t):
    n, l, r = map(int, input().split())
    a = list(map(int, input().split()))
    s = sorted(a[l - 1:r], reverse=True)
    before = sorted(a[:l - 1])
    after = sorted(a[r:n])
    ans1 = 0
    ans2 = 0
    for i in range(len(s)):
        if len(before) > i:
            ans1 += min(before[i], s[i])
        else:
            ans1 += s[i]
        if len(after) > i:
            ans2 += min(after[i], s[i])
        else:
            ans2 += s[i]
    print(min(ans1, ans2))


Solution 2 (runtime: 436 ms):
T = int(input())
answer = []

for _ in range(T):
    n, l, r = [int(num) for num in input().split()]
    arr = [int(num) for num in input().split()]

    left = arr[:l-1]
    right = arr[r:]
    mid = arr[l-1:r]

    left.sort()
    right.sort()
    mid.sort()

    p1 = 0
    p2 = len(mid)-1
    total = 0
    while p1<len(left) and p2>=0:
        profit = left[p1] - mid[p2]
        if profit>=0:
            break
        total += profit
        p1 += 1
        p2 -= 1
    
    delta1 = total

    p1 = len(mid)-1
    p2 = 0
    total = 0
    while p2<len(right) and p1>=0:
        profit = right[p2] - mid[p1]
        if profit>=0:
            break
        total += profit
        p1 -= 1
        p2 += 1
    
    delta2 = total


    answer.append(sum(mid)+min(delta1, delta2))


for el in answer:
    print(el)
Problem: 2063B - Subsequence Update
Language: python

Solution 1 (runtime: 155 ms):
t = int(input())
for _ in range(t):
    n, l, r = map(int, input().split())
    a = list(map(int, input().split()))
    s = sorted(a[l - 1:r], reverse=True)
    before = sorted(a[:l - 1])
    after = sorted(a[r:n])
    ans1 = 0
    ans2 = 0
    for i in range(len(s)):
        if len(before) > i:
            ans1 += min(before[i], s[i])
        else:
            ans1 += s[i]
        if len(after) > i:
            ans2 += min(after[i], s[i])
        else:
            ans2 += s[i]
    print(min(ans1, ans2))


Solution 2 (runtime: 343 ms):
from sys import stdin
input = stdin.buffer.readline

for _ in range(int(input())):
    n, l, r = map(int, input().split())
    *a, = map(int, input().split())
    
    seg = sorted(a[l - 1:r])
    pref = sorted(a[:l - 1])
    suf = sorted(a[r:])
    
    s = sum(seg)
    
    s1 = s
    k = 0
    while k < min(len(seg), len(pref)) and seg[-k - 1] > pref[k]:
        s1 += pref[k] - seg[-k - 1]
        k += 1
    
    s2 = s
    k = 0
    while k < min(len(seg), len(suf)) and seg[-k - 1] > suf[k]:
        s2 += suf[k] - seg[-k - 1]
        k += 1
    
    print(min(s1, s2))
Problem: 2063B - Subsequence Update
Language: python

Solution 1 (runtime: 155 ms):
t = int(input())
for _ in range(t):
    n, l, r = map(int, input().split())
    a = list(map(int, input().split()))
    s = sorted(a[l - 1:r], reverse=True)
    before = sorted(a[:l - 1])
    after = sorted(a[r:n])
    ans1 = 0
    ans2 = 0
    for i in range(len(s)):
        if len(before) > i:
            ans1 += min(before[i], s[i])
        else:
            ans1 += s[i]
        if len(after) > i:
            ans2 += min(after[i], s[i])
        else:
            ans2 += s[i]
    print(min(ans1, ans2))


Solution 2 (runtime: 171 ms):
t=int(input())
for _ in range(t):
    n,l,r=map(int,input().split())
    if n==1:
        s=input()
        print(int(s))
        continue
    lis=[int(i) for i in input().split()]
    x=lis[:l-1]
    y=lis[r:]
    if len(x)>0:
        x.sort()
    if len(y)>0:
        y.sort()
    o=lis[l-1:r]
    o.sort()
    low=0
    high=len(o)-1
    repsum=0
    while low<l-1 and high>=0:
        if x[low]<o[high]:
            repsum+=o[high]-x[low]
            low+=1
            high-=1
        else:
            break
    low=0
    high=len(o)-1
    rep2=0
    while high>=0 and low<len(y):
        if y[low]<o[high]:
            rep2+=o[high]-y[low]
            low+=1
            high-=1
        else:
            break
    u=max(rep2,repsum)
    print(sum(o)-u)