Cod sursa(job #1168999)
Utilizator | Data | 10 aprilie 2014 01:39:56 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.26 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("sdo.in");
ofstream g("sdo.out");
int n, i, v[3000001], k;
int main()
{
f>>n>>k;
for (i=1; i<=n; i++)
f>>v[i];
nth_element(v+1, v+k, v+n+1);
g<<v[k];
return 0;
}