Cod sursa(job #833986)
| Utilizator | Data | 13 decembrie 2012 16:09:40 | |
|---|---|---|---|
| Problema | Statistici de ordine | Scor | 50 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.44 kb |
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
int n, k ;
vector<int> v ;
int main()
{
freopen("sdo.in", "r", stdin);
freopen("sdo.out", "w", stdout);
scanf("%d%d", &n, &k);
for(int i = 0; i < n; ++i )
{
int x ;
scanf("%d", &x);
v.push_back(x) ;
}
nth_element( v.begin(), v.begin() + k, v.end() ) ;
printf("%d\n", v[k - 1] );
return 0 ;
}
