1 solutions

  • 0
    @ 2026-10-22 18:14:36

    C++ :

    #include<iostream>
    #include<algorithm>
    using namespace std;
    
    int T, n, m, k;
    long long a[1000005], b[1000005], ans;
    
    int main() { 
        cin>>n>>m>>k; 
        for (int i = 1; i <= n; i++) { 
            cin>>a[i]; ans += a[i]; 
        } 
        for (int i = 1; i <= m; i++) { 
            cin>>b[i]; ans += b[i]; 
        } 
        sort(a + 1, a + 1 + n); 
        int x = 0; 
        for (int i = n; i > max(0,n - m); i--) { 
            if (a[i] >= k)ans += a[i]; 
            else { 
                x = i; break; 
            } 
        } 
        if (x) ans += (long long)(min(m, n) - n + x) * k; 
        cout << ans; 
        return 0;
    }
    
    • 1

    Information

    ID
    342
    Time
    1000ms
    Memory
    128MiB
    Difficulty
    (None)
    Tags
    (None)
    # Submissions
    0
    Accepted
    0
    Uploaded By