code bawnngf c++ với ạ, mình đang cần gấp

/**
 *    author:  tđq
**/
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

const ll nmax = 1e6 + 1;

ll k, n, m, p;
int main()
{

 //freopen(task".inp" , "r" , stdin);
 //freopen(task".out" , "w" , stdout);

 ios::sync_with_stdio(false);
 cin.tie(0);

 cin >> k;
 cin >> n >> m >> p;
 if (n + m + p <= k) cout << n + m + p;
 else cout << max({n + m, m + p, n + p, n, m, p});
 return 0;
}

#include <iostream>
#include <algorithm>
using namespace std;

int main() {
    long long k, m, n, q;
    cin >> k >> m >> n >> q;

    long long max3 = 0;
    if (m <= k) max3 = max(max3, m);
    if (n <= k) max3 = max(max3, n);
    if (q <= k) max3 = max(max3, q);
    if (m + n <= k) max3 = max(max3, m + n);
    if (m + q <= k) max3 = max(max3, m + q);
    if (n + q <= k) max3 = max(max3, n + q);
    if (m + n + q <= k) max3 = max(max3, m + n + q);

    cout << max3 << endl;
    return 0;
}