Cod sursa(job #1293655)
Utilizator | Data | 16 decembrie 2014 12:11:18 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 70 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
//Sortare cu citire fstream
#include <cstdio>
#include <algorithm>
#include <fstream>
#define nmax 30000057
using namespace std;
ifstream f("sdo.in");
FILE *g=fopen("sdo.out","w");
int n,k;
int v[nmax];
int main()
{int i,j;
f>>n>>k;
for (i=1;i<=n;i++) f>>v[i];
sort(v+1,v+n+1);
fprintf(g,"%d",v[k]);
return 0;
}