Cod sursa(job #942292)
| Utilizator | Data | 21 aprilie 2013 19:22:23 | |
|---|---|---|---|
| Problema | Statistici de ordine | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.4 kb |
#include<fstream>
#include<algorithm>
#include<stdlib.h>
using namespace std;
ifstream f("sdo.in");
ofstream g("sdo.out");
int n,k,a[3000000];
int compare(const void* a,const void* b)
{
return(*(int*)a-*(int*)b);
}
void read()
{
int i;
f>>n;
f>>k;
for(i=1;i<=n;i++)
f>>a[i];
}
int main()
{
read();
nth_element(a+1, a+k, a+n+1);
g<< a[k] << "\n";
}
