Cod sursa(job #1164034)
| Utilizator | Data | 1 aprilie 2014 20:14:12 | |
|---|---|---|---|
| Problema | Statistici de ordine | Scor | 50 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.41 kb |
#include <iostream>
#include <fstream>
#include <stdlib.h>
using namespace std;
int cmp( const void*x, const void *y ) {
return *(int*)x - *(int*)y;
}
ifstream f("sdo.in");
ofstream g("sdo.out");
long n,i;int a[3000003];
int main()
{long k;
f>>n;f>>k;
for(i=0;i<n;i++) f>>a[i];
qsort(a,n,sizeof(a[0]),cmp);
//for(i=0;i<n;i++) g<<a[i]<<" ";
g<<a[k-1];
f.close();
g.close();
return 0;
}
