Cod sursa(job #1562535)
Utilizator | Data | 5 ianuarie 2016 11:41:33 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.25 kb |
#include <fstream>
#include <algorithm>
using namespace std;
#define MAX 3000005
ifstream f("sdo.in");
ofstream g("sdo.out");
int a[MAX],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];
}