Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- using namespace std;
- typedef long long ll;
- int main()
- {
- int n;
- ll x;
- cin >> n >> x;
- pair<ll, int> niza[n];
- for(int i = 0; i < n; i++) {
- cin >> niza[i].first;
- niza[i].second = i;
- }
- sort(niza, niza + n);
- for(int i = 0; i < n; i++) {
- for(int j = i + 1; j < n; j++) {
- int L = j + 1, R = n - 1;
- while(L < R) {
- ll sum = niza[i].first + niza[j].first + niza[L].first + niza[R].first;
- if(sum == x) {
- cout << niza[i].second + 1 << " " << niza[j].second +1 << " " << niza[L].second + 1 << " " << niza[R].second + 1 << endl;
- return 0;
- }
- if(sum < x) {
- L++;
- }
- else {
- R--;
- }
- }
- }
- }
- cout << "IMPOSSIBLE" << endl;
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement