/ SeriousOJ /

Record Detail

Accepted


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 344.0 KiB
#2 Accepted 2ms 580.0 KiB
#3 Accepted 1ms 344.0 KiB
#4 Accepted 20ms 820.0 KiB
#5 Accepted 19ms 892.0 KiB
#6 Accepted 19ms 768.0 KiB
#7 Accepted 2ms 532.0 KiB
#8 Accepted 20ms 1.52 MiB
#9 Accepted 19ms 1.688 MiB

Code

#include <bits/stdc++.h>
using namespace std;

void solve() {
  int n;
  cin >> n;
  vector<int> a(n);
  for (auto& ai : a) {
    cin >> ai;
  }
  vector<int> b(n);
  for (auto& bi : b) {
    cin >> bi;
  }
  vector<int> mx(n + 1);
  for (int i = n - 1; i >= 0; i--) {
    mx[i] = max(mx[i + 1], b[i]);
  }
  int64_t profit = 0;
  for (int i = 0; i < n; i++) {
    if (a[i] < mx[i]) {
      profit = profit + mx[i] - a[i];
    }
  }
  cout << profit << '\n';
}

int main() {
  ios_base::sync_with_stdio(0), cin.tie(0);
  int t = 1;
  cin >> t;
  for (int i = 1; i <= t; i++) {
    solve();
  }
  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:07:59
Judged At
2025-09-02 16:07:59
Judged By
Score
100
Total Time
20ms
Peak Memory
1.688 MiB