Problem: 2063B - Subsequence Update
Language: java

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

public final class F1{
	public static void main(String[] args){
		Scanner sc = new Scanner(System.in);
		int t = sc.nextInt();
		while(t-- != 0){
			int n = sc.nextInt();
			int l = sc.nextInt();
			int r = sc.nextInt();
			int[] arr = new int[n];
			int[] left = new int[r];
			int[] right = new int[n-l+1];
			for(int i = 0; i < arr.length; i++){
				arr[i] = sc.nextInt();
			}
			for(int i = 0; i < left.length; i++){
				left[i] = arr[i];
			}
			for(int i = 0; i < right.length; i++){
				right[i] = arr[l-1+i];
			}
			Arrays.sort(left);
			Arrays.sort(right);
			long sum1 = 0;
			long sum2 = 0; 
			for(int i = 0 ; i <= r - l; i++){
				sum1 += (long)left[i];
				sum2 += (long)right[i];
			}
			System.out.println(Math.min(sum1, sum2));
		}
	}		
}

Solution 2 (runtime: 233 ms):
import java.io.*;

import java.util.*;



public class Code {



    // Input and Output

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

    static PrintWriter out = new PrintWriter(System.out);



    // For parsing integers, longs, and strings efficiently

    static StringTokenizer st;



    // Entry point

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

        int t; // Number of test cases

        t = nextInt(); // Uncomment this line if multiple test cases

        while (t-- > 0) {

            solve(); // Call the solve function for each test case

        }

        out.close(); // Close the output stream

    }



    // Solve function for each test case



    static void solve() throws IOException {

        int n = nextInt();

        int l = nextInt();

        int r = nextInt();



        long[] arr = new long[n];



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

            arr[i] = nextLong();

        }

        long sum1 =0;

        long sum2 =0;



        long[] arr1 = new long[r];



        for (int i = 0; i < r; i++) {

            arr1[i] = arr[i];

        }

        sort(arr1);



        for(int i=0; i < r-l+1; i++){

            sum1 += arr1[i];

        }



        long[] arr2 = new long[n-l+1];



        for (int i = l-1; i < n; i++) {

            arr2[i-l+1] = arr[i];

        }

        sort(arr2);



        for(int i=0; i < r-l+1; i++) {

            sum2 += arr2[i];

        }



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

    }



    // Utility methods for faster input

    static String next() throws IOException {

        while (st == null || !st.hasMoreTokens()) {

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

        }

        return st.nextToken();

    }



    static int nextInt() throws IOException {

        return Integer.parseInt(next());

    }



    static long nextLong() throws IOException {

        return Long.parseLong(next());

    }



    static double nextDouble() throws IOException {

        return Double.parseDouble(next());

    }



    char nextChar() {

        try {

            return (char) br.read();

        } catch (IOException e) {

            e.printStackTrace();

            return '\0'; // Return null character in case of an error

        }

    }



    static String nextLine() throws IOException {

        return br.readLine();

    }



    // Utility functions

    static int gcd(int a, int b) {

        if (b == 0) return a;

        return gcd(b, a % b);

    }



    static int lcm(int a, int b) {

        return a * (b / gcd(a, b));

    }



    static boolean isPrime(int n) {

        if (n <= 1) return false;

        if (n <= 3) return true;

        if (n % 2 == 0 || n % 3 == 0) return false;

        for (int i = 5; i * i <= n; i += 6) {

            if (n % i == 0 || n % (i + 2) == 0) return false;

        }

        return true;

    }



    static long power(long x, long y, long p) {

        long res = 1;

        x = x % p;

        while (y > 0) {

            if ((y & 1) == 1)

                res = (res * x) % p;

            y = y >> 1;

            x = (x * x) % p;

        }

        return res;

    }



    public static void sort(int[] arr)

    {

        //because Arrays.sort() uses quicksort which is dumb

        //Collections.sort() uses merge sort

        ArrayList<Integer> ls = new ArrayList<Integer>();

        for(int x: arr)

            ls.add(x);

        Collections.sort(ls);

        for(int i=0; i < arr.length; i++)

            arr[i] = ls.get(i);

    }



    public static void sort(long[] arr)

    {

        //because Arrays.sort() uses quicksort which is dumb

        //Collections.sort() uses merge sort

        ArrayList<Long> ls = new ArrayList<Long>();

        for(long x: arr)

            ls.add(x);

        Collections.sort(ls);

        for(int i=0; i < arr.length; i++)

            arr[i] = ls.get(i);

    }

}