Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <cmath>
- #include <string>
- #include <vector>
- #include <algorithm>
- using namespace std;
- void Sort(int arr[], int n){
- for(int i = 0; i < n - 1; i++){
- for(int j = i + 1; j < n; j++){
- if(arr[i]>arr[j]){
- int temp = arr[i];
- arr[i] = arr[j];
- arr[j] = temp;
- }
- }
- }
- }
- int main(){
- int t;
- cin >> t;
- while(t--){
- int n, k;
- cin >> n >> k;
- int arr[n];
- for(int i = 0 ; i < n; i++){
- cin >> arr[i];
- }
- sort(arr, arr+n); // Version 1
- Sort(arr, n); // Version 2
- cout << arr[k-1] << endl;
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement