Cod sursa(job #1111319)
Utilizator | Data | 18 februarie 2014 19:51:41 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include <iostream>
#include <fstream>
#include <algorithm>
#define maxn 3 000 010
using namespace std;
ifstream in("sdo.in");
ofstream out("sdo.out");
int n,k;
int v[maxn];
int main()
{
in>>n>>k;
int i;
for(i=1;i<=n;i++)
in>>v[i];
nth_element(v+1,v+k,v+n+1);
out<<a[k];
return 0;
}