Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <vector>
- #include <fstream>
- #include <cstdlib>
- using namespace std;
- vector<int> v;
- int k;
- int partition(int l, int r) {
- r--;
- int p = v[(l + r) / 2];
- int i = l;
- int j = r;
- while (i <= j) {
- while (v[i] < p)
- i++;
- while (v[j] > p)
- j--;
- if (i >= j)
- break;
- swap(v[i++], v[j--]);
- }
- return j;
- }
- int find_st(int k) {
- int left, right;
- left = 0;
- right = v.size();
- while (true) {
- int mid = partition(left, right);
- if (mid == k) {
- return v[mid];
- }
- else if (k < mid) {
- right = mid;
- }
- else {
- left = mid + 1;
- }
- }
- }
- int main() {
- //---------------------------------------------
- freopen("kth.in", "r", stdin);
- freopen("kth.out", "w", stdout);
- //--------------------------------------------- /*/
- int n, A, B, C, a1, a2;
- cin >> n >> k >> A >> B >> C >> a1 >> a2;
- if (n == 1) {
- cout << a1;
- return 0;
- }
- v.push_back(a1);
- v.push_back(a2);
- for (int i = 2; i <= n; ++i) {
- v.push_back(A*v[i - 2] + B*v[i - 1] + C);
- }
- cout << find_st(k-1);
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement