Cod sursa(job #1193865)
Utilizator | Data | 2 iunie 2014 06:56:51 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;
vector < int > A;
int X,N,K,i;
int main()
{
freopen("sdo.in","r",stdin);
freopen("sdo.out","w",stdout);
scanf("%d%d",&N,&K);
for (i=1;i<=N;++i)
{
scanf("%d",&X);
A.push_back(X);
}
nth_element(A.begin(),A.begin()+K-1,A.end());
printf("%d\n",A[K-1]);
return 0;
}