Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <vector>
- using namespace std;
- int main(){
- int n;
- cin >> n;
- vector<int> P(n), K(n);
- for(int i = 0; i < n; i++) {
- cin >> P[i];
- }
- for(int i = 0; i < n; i++) {
- cin >> K[i];
- }
- vector<int> D(n);
- for(int i = 0; i < n; i++) {
- D[i] = P[i] - K[i];
- }
- int res = 0;
- if(D[0] > 0) {
- res += D[0];
- }
- for(int i = 1; i < n; i++) {
- if(D[i] - D[i - 1] > 0) {
- res += D[i] - D[i - 1];
- }
- }
- if(D[n - 1] < 0) {
- res += -D[n - 1];
- }
- cout << res << endl;
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment