Cod sursa(job #1086474)
| Utilizator | Data | 18 ianuarie 2014 10:01:56 | |
|---|---|---|---|
| Problema | Statistici de ordine | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.47 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("sdo.in");
ofstream g("sdo.out");
int acest_vector_se_numeste_petrutiu[3000005];
int main()
{
int n, k, i;
f>>n>>k;
for(i=1;i<=n;i++) f>>acest_vector_se_numeste_petrutiu[i];
nth_element(acest_vector_se_numeste_petrutiu+1, acest_vector_se_numeste_petrutiu+k, acest_vector_se_numeste_petrutiu+n+1);
g<<acest_vector_se_numeste_petrutiu[k];
f.close();
g.close();
return 0;
}
