#include #include using namespace std; long long solution(int cap, int n, vector deliveries, vector pickups) { long long deli_sum = 0; long long pick_sum = 0; for(auto d : deliveries) deli_sum += d; for(auto p : pickups) pick_sum += p; long long answer = 0; int longest = n-1; while(deli_sum > 0 || pick_sum > 0){ int c1 = cap; int dist1 = 0; int c2 = cap; int dist2 = 0; for(int i=longest; i>=0; i..