Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- using namespace std;
- long long v[200050], w[200050], x;
- int main()
- {
- ifstream fin("cioc.in");
- ofstream fout("cioc.out");
- int c, n, k, i;
- fin >> c >> n >> k;
- for(i = 0; i < n; ++i)
- {
- fin >> v[i];
- w[i] = v[i];
- }
- nth_element(w, w+k-1, w+n);
- x = w[k-1];
- cout << x;
- k = count_if(v, v+n, [&](long long i){ return (i <= x); });
- if(c == 1)
- fout << k;
- else
- {
- c = k;
- for(i = n-1; i >= 0; --i)
- {
- if(v[i] <= x)
- {
- v[i+c] = 2 * v[i];
- --c;
- }
- v[i+c] = v[i];
- }
- for(i = 0; i < n + k; ++i)
- (fout << v[i]).put(' ');
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement