Cod sursa(job #1516563)
Utilizator | Data | 3 noiembrie 2015 10:22:50 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.28 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("sdo.in");
ofstream g("sdo.out");
#define NMAX 3000010
int n, k, v[NMAX];
int main()
{
int i;
f>>n>>k;
for (i = 1;i <= n;i++)
f>>v[i];
nth_element(v + 1, v + k + 1, v + n + 1);
g<<v[k];
}