[洛谷]kkksc03考前临时抱佛脚

#include <iostream>
using namespace std;
int a, b, c, d;
int A[25]{0};
int B[25]{0};
int C[25]{0};
int D[25]{0};
int m_a = 0, m_b = 0, m_c = 0, m_d = 0;
int ans = 0; //负责记录总数
void start() //初始化，录入数据
{
    for (int i = 0; i < a; i++)
    {
        cin >> A[i];
        m_a += A[i];
    }
    for (int i = 0; i < b; i++)
    {
        cin >> B[i];
        m_b += B[i];
    }
    for (int i = 0; i < c; i++)
    {
        cin >> C[i];
        m_c += C[i];
    }
    for (int i = 0; i < d; i++)
    {
        cin >> D[i];
        m_d += D[i];
    }
}

void work_a(int n)
{
    int dp[m_a]{0};
    for (int i = 0; i < n; i++) //这是第i道题目
    {
        for (int r = m_a / 2; r >= A[i]; r--)
        {
            dp[r] = max(dp[r], dp[r - A[i]] + A[i]);
        }
    }
    ans += max(dp[m_a / 2], m_a - dp[m_a / 2]);
}
void work_b(int n)
{
    int dp[m_b]{0};
    for (int i = 0; i < n; i++) //这是第i道题目
    {
        for (int r = m_b / 2; r >= B[i]; r--)
        {
            dp[r] = max(dp[r], dp[r - B[i]] + B[i]);
        }
    }
    ans += max(dp[m_b / 2], m_b - dp[m_b / 2]);
}
void work_c(int n)
{
    int dp[m_c]{0};
    for (int i = 0; i < n; i++) //这是第i道题目
    {
        for (int r = m_c / 2; r >= C[i]; r--)
        {
            dp[r] = max(dp[r], dp[r - C[i]] + C[i]);
        }
    }
    ans += max(dp[m_c / 2], m_c - dp[m_c / 2]);
}
void work_d(int n)
{
    int dp[m_d]{0};
    for (int i = 0; i < n; i++) //这是第i道题目
    {
        for (int r = m_d / 2; r >= D[i]; r--)
        {
            dp[r] = max(dp[r], dp[r - D[i]] + D[i]);
        }
    }
    ans += max(dp[m_d / 2], m_d - dp[m_d / 2]);
}
int main()
{
    cin >> a >> b >> c >> d; //四种学科的题目数量
    start();
    work_a(a);
    work_b(b);
    work_c(c);
    work_d(d);
    cout << ans << endl;
    return 0;
}