Cod sursa(job #630681)
Utilizator | Neagoe Alexandru pykh | Data | 6 noiembrie 2011 12:42:30 |
---|---|---|---|
Problema | Statistici de ordine | Scor | 50 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.51 kb |
//#include<cstdio>
#include<fstream>
#include<algorithm>
using namespace std;
/*const char in[]="sdo.in";
const char out[]="sdo.out";
*/
ifstream f("sdo.in");
ofstream g("sdo.out");
const int N = 3000005;
int k, n, v[N];
int main()
{
//freopen(in,"r",stdin);
//freopen(out,"w",stdout);
//scanf("%d %d", &n, &k);
f>>n>>k;
for(int i = 1 ; i <= n ; ++i)
//scanf("%d", &v[i]);
f>>v[i];
nth_element(v + 1, v + k, v + 1 + n);
//printf("%d", v[k]);
g<<v[k];
return 0;
}