Cod sursa(job #713561)
Utilizator | Avramita Teodor Zexon | Data | 14 martie 2012 19:24:23 |
---|---|---|---|
Problema | Statistici de ordine | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include <iostream>
#include <algorithm>
#include <fstream>
#include <string>
#include <cstdio>
#include <cstdlib>
using namespace std;
ifstream in("sdo.in");
ofstream out("sdo.out");
int n,k;
int v[3000001];
int main()
{
string tmp;
in>>tmp;
n=atoi(tmp.c_str());
in>>tmp;
k=atoi(tmp.c_str());
for(int i=1;i<=n;i++)
{
in>>tmp;
v[i]=atoi(tmp.c_str());
}
sort(&v[1],&v[n+1]);
out<<v[k];
return 0;
}