Cod sursa(job #3257339)
Utilizator | Data | 17 noiembrie 2024 13:33:52 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 10 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.49 kb |
#include <fstream>
#include <iostream>
#include <algorithm>
#include <vector>
#include <cstring>
using namespace std;
ifstream fin("sdo.in");
ofstream fout("sdo.out");
int v[3000001];
int main()
{
int n,k;
fin>>n>>k;
for(int i=1;i<=n;i++)
fin>>v[i];
for(int i=1;i<n;i++)
for(int j=i+1;j<=n;j++)
if(v[i]>v[j])
{
int aux=v[i];
v[i]=v[j];
v[j]=aux;
}
fout<<v[k];
return 0;
}