Cod sursa(job #2338631)
Utilizator | Data | 7 februarie 2019 17:35:52 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 70 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <cstdio>
#include <algorithm>
#include <vector>
#define LMAX 3000005
using namespace std;
FILE *fin=fopen("sdo.in","r");
FILE *fout=fopen("sdo.out","w");
int n, k;
int a[LMAX];
int main()
{
fscanf(fin,"%d %d",&n,&k);
for (int i=0;i<n;++i)
{
fscanf(fin,"%d",&a[i]);
}
nth_element(a,a+k-1, a+n);
fprintf(fout,"%d\n",a[k-1]);
return 0;
}