Guardians and the Shadows

Problem Statement

Guardians and the Shadows Problem Description Alice is the owner of a large data center, filled with valuable information. To protect the data center, she has employed A number of skilled security experts known as "Guardians." The data center is located along a secure network route, and there are several nodes along the route, numbered from 1 to N. Each node is connected by high-speed fiber-optic cables, ensuring fast and efficient data transmission. You are given an array of integers B where B[i] is the distance between nodes i and i-1). One day, a group of M thieves known as "The Shadows" plotted to infiltrate the data center, and steal sensitive information. The Shadows devised a plan where each team member would reach a specific node on the network route at a designated time, and then wait for their opportunity to strike. This information is given in the form of a 2D array of integers C such that C[i][0] is the designated node of i-th thief and he required C[i][1] time to reach the