Cod sursa(job #1086486)
Utilizator | Data | 18 ianuarie 2014 10:24:25 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include <fstream>
#include <algorithm>
using namespace std;
int s[3000000];
int main()
{
int n,k;
ifstream f("sdo.in");
ofstream g("sdo.out");
f>>n>>k;
for (int i=0; i<n; i++)
f>>s[i];
nth_element(s,s+k-1,s+n);
g<<s[k-1];
return 0;
}