Cod sursa(job #2138315)
Utilizator | Data | 21 februarie 2018 15:50:17 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.25 kb |
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("sdo.in");
ofstream g("sdo.out");
int n,k,i,v[3000001];
int main()
{
f>>n>>k;
for(i=1;i<=n;i++)
f>>v[i];
sort(v+1,v+n+1);
g<<v[k];
}