Cod sursa(job #1680697)
Utilizator | Data | 8 aprilie 2016 23:25:53 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.32 kb |
#include <iostream>
#include <fstream>
#include <algorithm>
#include <vector>
using namespace std;
ifstream f("sdo.in");
ofstream g("sdo.out");
int V[3000005];
int n,k;
int main()
{
f>>n>>k;
for(int i=0;i<n;i++){
f>>V[i];
}
nth_element(V,V+k-1,V+n);
g<<V[k-1];
return 0;
}