Cod sursa(job #1401683)
Utilizator | Data | 26 martie 2015 08:24:50 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <stdio.h>
#include <algorithm>
#include <vector>
using namespace std;
std::vector<int> a;
int n,k,x;
int main()
{
freopen("sdo.in","r",stdin);
freopen("sdo.out","w",stdout);
scanf("%d %d",&n,&k);
for(int i=1;i<=n;++i)
{
scanf("%d",&x);
a.push_back(x);
}
nth_element(a.begin(),a.begin()+k-1,a.end());
printf("%d",a[k-1]);
return 0;
}