Cod sursa(job #783874)
Utilizator | Data | 4 septembrie 2012 12:51:52 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.28 kb |
#include<fstream>
#include<algorithm>
using namespace std;
int n,k,i,v[3000004];
int main()//se cauta al k-lea cel mai mic element
{
ifstream f("sdo.in"); ofstream g("sdo.out");
f>>n>>k;
for(i=1;i<=n;i++)f>>v[i];
nth_element(v+1,v+k,v+n+1);
g<<v[k];
f.close();g.close();
}