Cod sursa(job #369653)
| Utilizator | Data | 29 noiembrie 2009 01:12:49 | |
|---|---|---|---|
| Problema | Statistici de ordine | Scor | Ascuns |
| Compilator | cpp | Status | done |
| Runda | Marime | 0.26 kb |
#include <fstream>
#include <algorithm>
using namespace std;
#define MAX_N 3000005
ifstream fin ("sdo.in");
ofstream fout ("sdo.out");
int A[MAX_N], N, K;
int main()
{
fin >> N >> K;
for(int i = 1; i <= N; ++i)
fin >> A[i];
sort(A+1, A+N+1);
fout << A[K];
}
