Cod sursa(job #2092602)
Utilizator | Data | 21 decembrie 2017 23:16:24 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 50 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("sdo.in");
ofstream g("sdo.out");
#define MAX_N 3000001
int n,k;
int v[3000005];
int main()
{
f >> n >> k;
for(int i = 0 ; i <n; i++)
{
f >> v[i];
}
f.close();
nth_element(v, v+k-1, v+n);
for(int i = 0 ; i <n; i++)
{
cout<<v[i]<<" ";
}
g<<v[k-1];
g.close();
}