Cod sursa(job #1971059)
Utilizator | Data | 19 aprilie 2017 19:55:29 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.27 kb |
#include <bits/stdc++.h>
#define DM 3000005
using namespace std;
ifstream fin("sto.in");
ofstream fout("sto.out");
int n,k,v[DM];
int main()
{
fin>>n>>k;
for(int i=1;i<=n;++i) fin>>v[i];
nth_element(v+1,v+k+1,v+n+1);
fout<<v[k];
return 0;
}