-
Notifications
You must be signed in to change notification settings - Fork 0
/
question_01.cpp
50 lines (37 loc) · 1003 Bytes
/
question_01.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
/*
==> Kth smallest element <==
Question Link:- https://practice.geeksforgeeks.org/problems/kth-smallest-element5635/1?page=1&difficulty[]=1&category[]=Arrays&sortBy=submissions
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.
Example 1:
Input:
N = 6
arr[] = 7 10 4 3 20 15
K = 3
Output : 7
Explanation :
3rd smallest element in the given
array is 7.
Example 2:
Input:
N = 5
arr[] = 7 10 4 20 15
K = 4
Output : 15
Explanation :
4th smallest element in the given
array is 15.
*/
#include <iostream>
#include <algorithm>
using namespace std;
int kthSmallest(int arr[], int l, int r, int k) {
sort(arr,arr+r+1);
return arr[k-1];
}
int main () {
int arr[] = { 7, 10, 4, 20, 15 };
cout << kthSmallest(arr, 0, 4, 4) << endl;
return 0;
}