Cod sursa(job #791216)
Utilizator | Data | 23 septembrie 2012 13:37:36 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include <fstream>
#include <algorithm>
#define MAX 3000005
using namespace std;
int v[MAX], n, k;
int main()
{
ifstream in("sdo.in"); in>>n>>k;
for(int i = 1; i <= n; i++) in>>v[i];
in.close(); ofstream out("sdo.out");
nth_element(v + 1, v + k, v + n + 1);
out<<v[k]; out.close();
return 0;
}