Kth smallest element

Given an array arr[] and an integer K where K is smaller than size of array, the task is to find the Kth smallest element in the given array. It is given that all array elements are distinct.

---

STUDYEVERTHING

---

// { Driver Code Starts

//Initial function template for C++

#include<bits/stdc++.h>

using namespace std;

 // } Driver Code Ends

//User function template for C++

class Solution{

    public:

    // arr : given array

    // l : starting index of the array i.e 0

    // r : ending index of the array i.e size-1

    // k : find kth smallest element and return using this function

    int kthSmallest(int arr[], int l, int r, int k) {

      int ans;

      sort(arr, arr+r+1);

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

          if(i+1==k){

              ans = arr[i];

          }

      }

      return ans;

    }

};

// { Driver Code Starts.

 

int main()

{

    int test_case;

    cin>>test_case;

    while(test_case--)

    {

        int number_of_elements;

        cin>>number_of_elements;

        int a[number_of_elements];

       

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

            cin>>a[i];

           

        int k;

        cin>>k;

        Solution ob;

        cout<<ob.kthSmallest(a, 0, number_of_elements-1, k)<<endl;

    }

    return 0;

}  // } Driver Code Ends

best gaming headphones

Happy Coding 😊.