Cod sursa(job #416158)
| Utilizator | Data | 12 martie 2010 12:00:24 | |
|---|---|---|---|
| Problema | Statistici de ordine | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.38 kb |
#include <fstream>
#include <algorithm>
#define NMAX 3000010
using namespace std;
ifstream fin("sdo.in");
ofstream fout("sdo.out");
int A[NMAX],N,K;
void citire()
{
fin>>N>>K;
int i;
for(i=1;i<=N;i++)
fin>>A[i];
fin.close();
}
void afisare()
{
fout<<A[K];
fout.close();
}
int main()
{
citire();
nth_element(A+1,A+K,A+1+N);
afisare();
}
