Flip Flops

    1#include <bits/stdc++.h>
    2using namespace std;
    3using ll = long long;
    4using i128 = __int128;
    5const int inf = 1e9;
    6const ll INF = 1e18; //❄️
    7void solve() {
    8    int n;
    9    ll c, k; cin >> n >> c >> k;
    10    vector<ll> v(n);
    11    for (int i = 0; i < n; i++) {
    12        cin >> v[i];
    13    }
    14    sort(v.begin(), v.end());
    15    ll cur = c;
    16    for (int i = 0; i < n; i++) {
    17        if (cur >= v[i]) {
    18            if (k > 0) {
    19                ll diff = cur - v[i];
    20                cur += min(k, diff);
    21                k -= min(k, diff);
    22                cur += v[i];
    23            } else {
    24                cur += v[i];
    25            }
    26        } else {
    27            break;
    28        }
    29    }
    30    cout << cur << '\n';
    31}
    32int main() {
    33    ios::sync_with_stdio(0); cin.tie(0); 
    34    int t; cin >> t;
    35    while (t--) {
    36        solve();
    37    }
    38    return 0;
    39}