Cod sursa(job #1184831)
Utilizator | Data | 14 mai 2014 11:25:24 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.32 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];
nth_element(A+1, A+k, A+n+1);
fout << A[k] << "\n";
}