Cod sursa(job #782137)
Utilizator | Arnautu Alexandru alexarnautu | Data | 25 august 2012 23:32:00 |
---|---|---|---|
Problema | Statistici de ordine | Scor | 50 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.54 kb |
#include <cstdio>
#include <algorithm>
#include <vector>
using namespace std;
FILE * iFile;
FILE * oFile;
int n, k;
vector<long long> m;
void read()
{
long long x, i;
fscanf(iFile, "%d %d", &n, &k);
for(i=1;i<=n;i++)
{
fscanf(iFile, "%lld", &x);
m.push_back(x);
}
}
void solve()
{
sort(m.begin(), m.end());
fprintf(oFile, "%lld", m[k-1]);
}
int main()
{
iFile = fopen("sdo.in", "r");
oFile = fopen("sdo.out", "w");
read();
solve();
fclose(iFile);
fclose(oFile);
return 0;
}