kth smallest element in array.cpp

/* the following code demonstrates how to find kth smallest
element using set from C++ STL */
 
#include<iostream>
#include<set>
using namespace std;
 

int main()
{
 

    int arr[] = { 12, 3, 5, 7, 19 };

    int n = sizeof(arr) / sizeof(arr[0]); //size of array

    int k=4;
 

    set<int> s(arr, arr+n);
    // or set<int> s(begin(arr),end(arr));

    set<int>::iterator itr= s.begin(); // s.begin() returns a pointer to first element in the set

   advance(itr, k-1); // itr points to kth element in set - 'advance' advances/moves the position of itr to k 
 
    // to print a set -: for (auto it=s.begin(); it !=s.end();it++ ) cout<<" "<<*it;
    
    cout << *itr << "\n";
 

    return 0;
}