Cod sursa(job #1322089)
Utilizator | Data | 19 ianuarie 2015 19:26:52 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.27 kb |
#include<fstream>
#include<algorithm>
using namespace std;
ifstream f("sdo.in");
ofstream g("sdo.out");
int n,k,a[3000005];
int main()
{ f>>n>>k;
for(int i=1;i<=n;i++)
f>>a[i];
nth_element(a+1,a+k,a+n+1);
g<<a[k];
return 0;
}