Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- using namespace std;
- int n, k, a[1002001], nr;
- bool isPrime(int k) {
- if(k <= 1) return 0;
- for(int i = 2; i * i <= k; i++)
- if(k % i == 0)
- return 0;
- return 1;
- }
- int main() {
- freopen("coriandru.in", "r", stdin);
- freopen("coriandru.out", "w", stdout);
- cin >> n >> k;
- for(int i = 1; i <= n; i++) cin >> a[i];
- sort(a + 1, a + n + 1);
- for(nr = 1;k ; nr++)
- k -= isPrime(nr);
- nr--; nr %= n; nr = n + 1 - nr; a[0] = a[n];
- a[n + 1] = a[1];
- cout << a[nr] << ' ' << a[nr - 1] << '\n';
- }
- /*
- 0 - 1
- 1 - 2
- 2 - 3
- ..
- n-1 - n
- */
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement