Cod sursa(job #634169)
Utilizator | Andrei Diaconu andrei_diaconu | Data | 15 noiembrie 2011 19:28:40 |
---|---|---|---|
Problema | Statistici de ordine | Scor | 0 |
Compilator | c | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include<iostream>
#include<fstream>
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];
for(i=1;i<=n;i++)
{
for(j=i+1;j<=n;j++)
{
if(M[i]>M[j])
{
pivot=M[i];
M[i]=M[j];
M[j]=pivot;
}
}
}
out<<M[k];
in.close();
out.close();
return 0;
}