Cod sursa(job #1346651)
| Utilizator | Data | 18 februarie 2015 15:09:36 | |
|---|---|---|---|
| Problema | Statistici de ordine | Scor | 70 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.5 kb |
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("sdo.in");
ofstream fout("sdo.out");
const int NMAX = 3000000;
int n, k, v[NMAX+3];
void citeste(){
fin>>n>>k;
for(int i=1;i<=n;i++){
fin>>v[i];
}
}
void scrie(){
//!!! Sterge-ma
//for(int i=1;i<=n;i++){
// cout<<v[i] << ' ';
//}
fout<<v[k];
}
int main()
{
citeste();
sort(v+1, v+n+1);
scrie();
return 0;
}
