Pagini recente » Cod sursa (job #3168107) | Diferente pentru problema/ciob intre reviziile 15 si 22 | Cod sursa (job #2255575) | Cod sursa (job #2242052) | Cod sursa (job #1037479)
#include <iostream>
#include <fstream>
#include <algorithm>
#include <vector>
#include <queue>
#include <bitset>
using namespace std;
ifstream fin ("sdo.in");
ofstream fout("sdo.out");
#define MAX 100100
int a[MAX], n, i, k;
int main()
{
fin>>n>>k;
for(i=1;i<=n;i++)
{
fin>>a[i];
}
nth_element(a+1, a+k, a+n+1);
fout<<a[k];
return 0;
}