Cod sursa(job #565763)
| Utilizator |  cristescu liviu ms-ninja |
Data | 28 martie 2011 11:42:38 |
|---|---|---|---|
| Problema | Statistici de ordine | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.29 kb |
#include <fstream>
using namespace std;
#define dim 3000001
int v[dim];
int main()
{
ifstream fin("sdo.in");
ofstream fout("sdo.out");
int n, i, k;
fin>>n >>k;
for(i=1;i<=n;++i)
fin>>v[i];
//sort(v+1,v+n+1);
nth_element(v+1,v+k,v+n+1);
fout<<v[k];
return 0;
}