Cod sursa(job #730913)
Utilizator | Data | 7 aprilie 2012 01:37:37 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.3 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("sdo.in");
ofstream g("sdo.out");
const int maxn=3000100;
int n, k, i, a[maxn];
int main()
{
f>>n>>k;
for(i=1; i<=n; ++i) f>>a[i];
nth_element(a+1, a+k, a+n+1);
g<<a[k]<<"\n";
return 0;
}