Cod sursa(job #1019726)
Utilizator | Data | 31 octombrie 2013 20:48:38 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.28 kb |
#include<iostream>
#include<algorithm>
#include<fstream>
using namespace std;
int n,k,v[3000001];
int main()
{
int i;
ifstream f("sdo.in");
ofstream g("sdo.out");
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;
}