[C++] O(N) 0ms 
ApproachThe purpose of the me is to go to the target, and the purpose of the ghost is to prevent the me from going to the target.Therefore, if the ghost arrives

# Approach
<!-- Describe your approach to solving the problem. -->
The purpose of the me is to go to the target, and the purpose of the ghost is to prevent the me from going to the target.

Therefore, if the ghost arrives at the target before the me, the me will not be able to fulfill its purpose and we can return false.

If ME can get to target before all ghosts, we return true.

# Complexity
- Time complexity:
O(N)



# Code
```cpp []
class Solution {
public:
    bool escapeGhosts(vector<vector<int>>& ghosts, vector<int>& target) {
        // Total distance for me to get to target 
        int dist = abs(target[0]) + abs(target[1]);

        // If any of the distances for ghost to get to target is less than or equal to dist distance, return false
        for (const vector<int>& ghost : ghosts)
            if (abs(target[0] - ghost[0]) + abs(target[1] - ghost[1]) <= dist) return false;
        
        return true;
    }
};
```
['C++']