Cod sursa(job #906850)
Utilizator | Data | 7 martie 2013 11:47:36 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.28 kb |
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
int a[3000001];
int main()
{ifstream fin("sdo.in");
ofstream fout("sdo.out");
int n,k,i;
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;
}