Cod sursa(job #1401689)
Utilizator | Data | 26 martie 2015 08:27:23 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 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);
a.resize(n+1);
for(int i=1;i<=n;++i)
{
scanf("%d",&a[i]);
}
nth_element(a.begin()+1,a.begin()+k,a.begin()+n+1);
printf("%d",a[k]);
return 0;
}