Cod sursa(job #1389305)
Utilizator | Data | 16 martie 2015 10:17:35 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.25 kb |
#include<fstream>
#include<algorithm>
using namespace std;
ifstream f("sdo.in");
ofstream g("sdo.out");
int a[3000001],n,k;
int main(){
f>>n>>k;
for(int i=1;i<=n;i++) f>>a[i];
nth_element(a+1,a+k,a+n+1);
g<<a[k];
return 0;
}