Cod sursa(job #629970)
Utilizator | Data | 4 noiembrie 2011 12:03:34 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.24 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("sdo.in");
ofstream g("sdo.out");
int v[3000001],n,k;
int main(){
f>>n>>k;
for(int i=0;i<n;i++)f>>v[i];
nth_element(v,v+k,v+n);
g<<v[k-1];
}