Cod sursa(job #1117065)
Utilizator | Data | 22 februarie 2014 23:53:06 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 50 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.26 kb |
#include <fstream>
#include <algorithm>
using namespace std;
int main()
{
ifstream f("sdo.in");
ofstream g("sdo.out");
int v[510000],i,n,k;
f>>n>>k;
for (i=1; i<=n; i++)
f>>v[i];
sort(v+1,v+n+1);
g<<v[k];
return 0;
}