Cod sursa(job #1318753)
| Utilizator | Data | 16 ianuarie 2015 12:27:14 | |
|---|---|---|---|
| Problema | Statistici de ordine | Scor | 70 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.29 kb |
#include<iostream>
#include<fstream>
#include<algorithm>
using namespace std;
ifstream f("sdo.in");
ofstream g("sdo.out");
int a[3000000],n,k;
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;
}
