✅Optimal Goodies (Contest)

Optimal Goodies (Contest) easy Time Limit: 2 sec Memory Limit: 128000 kB

Problem Statement :

Tono loves to do shopping. Today, she went to the market where there are N different types of products. She wants to buy exactly K of them at the minimum cost. Although she is super smart, she wants to check your smartness as well. Can you tell her the minimum cost required to buy exactly K products if she has already decided to buy product J?

Note: Tono does not buy the same product twice, and Tono will definitely buy product J (J is the index of the item). Input The first line of the input contains three integers, N, K, and J, denoting the number of products in the market, the number of products Tono needs to buy, and the product that Tono will definitely buy. The next line contains N singly spaced integers, the cost of the N products C[1], C[2], ..., C[N].

Constraints: 1 <= N <= 200000 1 <= K <= N 1 <= J <= N 1 <= C[i] <= 1000

Output Output a single integer, the minimum amount Tono needs to pay. Example Sample Input 1: 5 3 4 1 2 3 4 5

Sample Output 1: 7

Sample Input 2: 5 1 3 2 4 3 1 1

Sample Output 2: 3

Explanation: Tono needs to buy exactly 3 products, and she will definitely buy the 4th product. Thus, she will buy the 1st, 2nd, and the 4th product. The total cost she pays is 1+2+4=7.

link:https://my.newtonschool.co/playground/code/7zqzajvbw0vv/

```java
import java.io.*; // for handling input/output
import java.util.*; // contains Collections framework

// don't change the name of this class
// you can add inner classes if needed
class Main {
    public static void main (String[] args) {
        // Your code here
        int n, k, j;
        Scanner sc=new Scanner(System.in);
        n=sc.nextInt();
        k=sc.nextInt();
        j=sc.nextInt();
        int arr[]=new int[n];
        int t=0;
        for(int i=0; i<n;i++){
            if(i==j-1){
                t=sc.nextInt();
                arr[i]=Integer.MAX_VALUE;
                continue;
            }
            arr[i]=sc.nextInt();
        }
        Arrays.sort(arr);
        for(int i=0; i<k-1;i++){
            t += arr[i];
        }
        System.out.println(t);
    }
}

///method 02

import java.io.*; // for handling input/output
import java.util.*; // contains Collections framework

// don't change the name of this class
// you can add inner classes if needed
class Main {
    public static void main (String[] args) {
        // Your code here
        Scanner reader=new Scanner(System.in);
        int N=reader.nextInt();
        int K=reader.nextInt();
        int J=reader.nextInt();
        PriorityQueue<Integer>list=new PriorityQueue<>();
        int sum=0;
        for(int i=1;i<=N;i++){
            int Z=reader.nextInt();
            if(i==J){
                sum=Z;
                
                continue;
            }
            list.add(Z);

        }
        while(K!=1){
            sum+=list.remove();
            K--;
        }
        System.out.println(sum);
    }
}