#include <bits/stdc++.h> using namespace std; typedef long long ll; typedef pair <int,int> p; const int N = 2e5+45; int n,pf[N]; p a[N]; vector <int> sol; vector <int> find_subset(int l,int u,vector <int> w){ n = w.size(); for(int i = 0; i < n; i++){ a[i+1].first = w[i]; a[i].second = i; } sort(a+1,a+n+1); for(int i = 1; i <= n; i++){ pf[i] = pf[i-1] + a[i].first; } for(int i = 1; i <= n; i++){ int l = i,r = n,ans = 0; while(l <= r){ int mid = l+(r-l)/2; if(pf[mid]-pf[l-1] <= u){ ans = mid; l = mid+1; } else{ r = mid-1; } } if(ans){ int suma = pf[ans] - pf[l-1]; if(suma >= l){ for(int j = i; j <= ans; j++){ sol.push_back(a[i].second); } } } } return sol; }