/ SeriousOJ /

Record Detail

Accepted


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 532.0 KiB
#2 Accepted 3ms 532.0 KiB
#3 Accepted 1ms 532.0 KiB
#4 Accepted 70ms 832.0 KiB
#5 Accepted 93ms 804.0 KiB
#6 Accepted 75ms 676.0 KiB
#7 Accepted 10ms 532.0 KiB
#8 Accepted 70ms 1.668 MiB
#9 Accepted 75ms 1.504 MiB

Code

#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define endl "\n"

int get_int(string s) {
    int ans = 0;
    int k = 1;

    for (int i = s.size()-1; i >= 0; i--) {
        int x = s[i] -'0';
        ans += x * k;
        k *= 10;
    }
    return ans;
}

int main() {
    int t; cin >> t; while (t--) {
        int n; cin >> n;
        int a[n + 1];
        int b[n + 1];
        int suf[n + 1] = {0};
        ll ans = 0;
        for (int i = 1; i <= n; i++) {
            cin >> a[i];
        }
        for (int i = 1; i <= n; i++) {
            cin >> b[i];
        }


        suf[n] = b[n];
        for (int i = n - 1; i >= 1; i--) {
            suf[i] = max(b[i], suf[i + 1]);
        }



        for (int i = 1; i <= n; i++) {
            if (a[i] <= suf[i]) {
                ans += suf[i] - a[i];
            }
        }

        cout << ans << endl;
    }

}

Information

Submit By
Type
Submission
Problem
P1228 Business Strategy
Contest
LUCC Presents Kick & Code Intra LU Programming Contest
Language
C++17 (G++ 13.2.0)
Submit At
2025-09-01 07:17:21
Judged At
2025-09-01 07:17:21
Judged By
Score
100
Total Time
93ms
Peak Memory
1.668 MiB