Cod sursa(job #1842646)
Utilizator | Data | 7 ianuarie 2017 13:23:06 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.27 kb |
#include <bits/stdc++.h>
#include <algorithm>
using namespace std;
ifstream f("sdo.in");
ofstream g("sdo.out");
int n,k,i,x[3000010];
int main()
{
f>>n>>k;
for(i=1;i<=n;i++)
f>>x[i];
nth_element(x+1,x+k,x+n+1);
g<<x[k];
return 0;
}