Cod sursa(job #1019834)
Utilizator | Data | 31 octombrie 2013 23:17:20 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include <fstream>
#include <algorithm>
#include <iostream>
#define maximul 3000005
using namespace std;
ifstream fin ("sdo.in");
ofstream fout ("sdo.out");
int a[maximul], n, k;
int main()
{
fin >> n >> k;
for(int i = 1; i <= n; ++i)
fin >> a[i];
sort(a+1, a+n+1);
fout << a[k];
system("Pause");
}