Cod sursa(job #634218)
Utilizator | Data | 15 noiembrie 2011 20:57:14 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include<iostream>
#include<fstream>
#include<conio.h>
using namespace std;
const int q=3000010;
int n,k,i,j,pivot,M[q];
int main()
{
ifstream in("sdo.in",ios::in);
ofstream out("sdo.out",ios::out);
in>>n>>k;
for(i=1;i<=n;i++)
in>>M[i];
sort(M+1,M+n+1);
out<<M[k];
in.close();
out.close();
return 0;
}