Problem: 2063B - Subsequence Update
Language: java

Solution 1 (runtime: 312 ms):
import java.io.*;
import java.util.*;

public class TestCodeforces
{
    public static void main(String[] args)
    {
        FastReader fr = new FastReader();
        PrintWriter pw = new PrintWriter(System.out);
        int t = fr.nextInt();
        while(t-->0)
        {
            int n = fr.nextInt();
            int l = fr.nextInt();
            int r = fr.nextInt();
            int wnd = r-l+1;
            long arr[] = new long[n];
            for(int i=0; i<n; i++)
            {   
                arr[i] = fr.nextInt();
            }   
            long min_sum = Math.min(sortSum(Arrays.copyOfRange(arr, 0, r), wnd), sortSum(Arrays.copyOfRange(arr, l-1, n), wnd));
            pw.println(min_sum);
        }
        pw.flush();
        pw.close();
    }

    public static long sortSum(long arr[], int z)
    {
        long sum = 0;
        Arrays.sort(arr);
        for(int i=0; i<z; i++)
        {
            sum += arr[i];
        }
        return sum;
    }
    static class FastReader
    {
        BufferedReader br; 
        StringTokenizer st;
        public FastReader() {
            br = new BufferedReader(new InputStreamReader(System.in));
        }
        String next() {
            while (st == null || !st.hasMoreElements()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }
        int nextInt() {
            return Integer.parseInt(next());
        }

        long nextLong() {
            return Long.parseLong(next());
        }

        double nextDouble() {
            return Double.parseDouble(next());
        }

        String nextLine() {
            String str = "";
            try {
                str = br.readLine();
            } catch (IOException e) {
                e.printStackTrace();
            }
            return str;
        }
    }
    
    static public boolean isPrime(int n)
    {
        int z=0;
        for(int i=2; i<=n/2; i++)
        {
            if(n%i==0)
            {
                z++;
            }
        }
        if(z==1)
        {
            return true;
        }
        return false;
    }
    
    public static int gcd(int a, int b)
    {
        if (b == 0) return a;
        return gcd(b, a % b);
    }

}

Solution 2 (runtime: 281 ms):
import java.util.*;

import java.io.*;

public class MooCounting {

    public static void main(String[] args) throws IOException{

        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));

        int t = Integer.parseInt(br.readLine());



        while(t-- > 0)

        {

            StringTokenizer st = new StringTokenizer(br.readLine());

            int n = Integer.parseInt(st.nextToken());

            int left = Integer.parseInt(st.nextToken());

            left--;

            int right = Integer.parseInt(st.nextToken());

            right--;

            long k = (long)right - (long)left + 1;



            st = new StringTokenizer(br.readLine());

            int[] arr = new int[n];

            for(int i = 0; i < n; i++)

            {

                arr[i] = Integer.parseInt(st.nextToken());

            }



            // Case 1: [l, n]

            int[] option1 = Arrays.copyOfRange(arr, left, n);

            Arrays.sort(option1);

            long sum1 = 0;

            for (int i = 0; i < k; i++) sum1 += option1[i];



            // Case 2: [1, r]

            int[] option2 = Arrays.copyOfRange(arr, 0, right + 1);

            Arrays.sort(option2);

            long sum2 = 0;

            for (int i = 0; i < k; i++) sum2 += option2[i];



            

            System.out.println(Math.min(sum1, sum2)); 

        }

    }

}