/ SeriousOJ /

Record Detail

Accepted


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 320.0 KiB
#2 Accepted 2ms 580.0 KiB
#3 Accepted 1ms 324.0 KiB
#4 Accepted 20ms 844.0 KiB
#5 Accepted 20ms 1.004 MiB
#6 Accepted 20ms 952.0 KiB
#7 Accepted 2ms 580.0 KiB
#8 Accepted 18ms 2.094 MiB
#9 Accepted 18ms 2.078 MiB

Code

#include<bits/stdc++.h>
using namespace std;
#define int long long
#define endl "\n"
#define ff first
#define ss second
#define pb push_back
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define pii pair<int,int>
#define Fast ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
const int MOD = 1000000007;
const int INF = 1e18;
const int N = 2e5;
void solve(int tc){
    int n; cin >> n;
    vector<int>a(n),b(n);
    for(int i=0;i<n;i++)cin >> a[i];
    for(int i=0;i<n;i++)cin >> b[i];
    int mx = -INF,ans = 0;
    for(int i=n-1;i>=0;i--){
        mx = max(mx,b[i]);
        ans += max(0ll,mx - a[i]);
    }
    cout << ans << endl;
}
int32_t main(){
    Fast
    int t=1;
    cin >> t;
    for(int tc=1;tc<=t;tc++)
        solve(tc);
    return 0;
}

Information

Submit By
Type
Submission
Problem
P1228 Business Strategy
Contest
LUCC Presents Intra LU Junior Programming Contest - Replay
Language
C++17 (G++ 13.2.0)
Submit At
2025-09-02 16:57:42
Judged At
2025-09-02 16:58:38
Judged By
Score
100
Total Time
20ms
Peak Memory
2.094 MiB