Cod sursa(job #658822)
Utilizator | Data | 9 ianuarie 2012 17:26:23 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.29 kb |
#include<algorithm>
#include<fstream>
using namespace std;
#define max 3000001
int n, k, m[max];
ifstream f("sdo.in");
ofstream g("sdo.out");
int main ()
{
f>>n>>k;
for(int i=1;i<=n;i++) f>>m[i];
nth_element(m+1, m+k, m+n+1);
g<<m[k]<<"\n";
return 0;
}