Cod sursa(job #1044542)
| Utilizator | Data | 30 noiembrie 2013 00:00:07 | |
|---|---|---|---|
| Problema | Statistici de ordine | Scor | 70 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.28 kb |
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
long n,k,i,a[3000000];
int main()
{
ifstream f("sdo.in");
ofstream g("sdo.out");
f>>n>>k;
for(i=0;i<n;i++)
f>>a[i];
sort(a+0,a+n);
g<<a[k-1];
return 0;
}
