C++ HackerRank|Algorithmic Crush

1. Dashboard 
2.  Data Structures 
3.  Arrays 
4.  Algorithmic Crush

5. 1. #include <vector>#include <iostream>using namespace std;int main() {    int n, m, a, b, k, max = 0;    cin >> n >> m;    vector<long long> arr(n + 2, 0);    for (int i = 1; i <= m; ++ i)    {        cin >> a >> b >> k;        arr[a] += k;        arr[b + 1] -= k;    }    long long ans = 0, temp = 0;    for (int i = 1; i <= n; ++ i)    {        temp += arr[i];        ans = ans > temp ? ans : temp;    }    cout << ans << endl;    return 0;}