Cod sursa(job #2245834)
Utilizator | Data | 25 septembrie 2018 22:39:39 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.28 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("sdo.in");
ofstream g ("sdo.out");
const int MAX_N = 3000005;
int A[MAX_N], N, K;
int main()
{
f>>N>>K;
for(int i=1;i<=N;++i)
f>>A[i];
nth_element(A+1, A+K, A+N+1);
g << A[K] << "\n";
}