Cod sursa(job #1037480)
Utilizator | Data | 20 noiembrie 2013 12:00:02 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 50 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <iostream>
#include <fstream>
#include <algorithm>
#include <vector>
#include <queue>
#include <bitset>
using namespace std;
ifstream fin ("sdo.in");
ofstream fout("sdo.out");
#define MAX 300100
int a[MAX], n, i, k;
int main()
{
fin>>n>>k;
for(i=1;i<=n;i++)
{
fin>>a[i];
}
nth_element(a+1, a+k, a+n+1);
fout<<a[k];
return 0;
}