Pagini recente » Cod sursa (job #21634) | Cod sursa (job #526472) | Cod sursa (job #2536819) | Cod sursa (job #2871752) | Cod sursa (job #2321157)
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
int sdo(vector<int> v, int k) {
int left = 0, right = v.size() - 1;
while(left != right) {
if(v[left] > v[k]) {
swap(v[left], v[k]);
}
if(v[k] > v[right]) {
swap(v[k], v[right]);
}
left = min(left + 1, k);
right = max(right - 1, k);
}
return v[k];
}
int main()
{
int n, k;
vector<int> v;
ifstream in("sdo.in");
ofstream out("sdo.out");
in >> n >> k;
k--;
for(int i = 0; i < n; ++i) {
int x;
in >> x;
v.push_back(x);
}
out << sdo(v, k);
in.close(); out.close();
return 0;
}