Accepted
Code
#include<bits/stdc++.h>
using namespace std;
const long long mode=1e9+7;
int main()
{
int t;
cin>>t;
while(t--){
int a;
cin>>a;
vector<int>v1,v2;
for(int i=1;i<=a;i++){
int x;
cin>>x;
v1.push_back(x);
}
for(int i=1;i<=a;i++){
int x;
cin>>x;
v2.push_back(x);
}
long long sum=0;
int mx=0;
for(int i=a-1;i>=0;i--){
if(v2[i]>v1[i]){
int x=v2[i]-v1[i];
int y=mx-v1[i];
sum+=max(x,y);
}
else{
if(mx>v1[i]){
sum+=mx-v1[i];
}
}
mx=max(v2[i],mx);
}
cout<<sum<<endl;
}
}
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 17:43:06
- Judged At
- 2025-09-02 17:43:06
- Judged By
- Score
- 100
- Total Time
- 72ms
- Peak Memory
- 1.555 MiB