Cod sursa(job #376969)
| Utilizator | Data | 22 decembrie 2009 23:26:28 | |
|---|---|---|---|
| Problema | Statistici de ordine | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.29 kb |
#include <fstream>
#include <algorithm>
using namespace std;
#define MAX_N 3000005
ifstream fin ("sdo.in");
ofstream fout ("sdo.out");
int N, K, V[MAX_N];
int main()
{
fin >> N >> K;
for(int i = 1; i <= N; ++i)
fin >> V[i];
nth_element(V+1, V+K, V+N+1);
fout << V[K] << "\n";
}
