Submission #1365303

#TimeUsernameProblemLanguageResultExecution timeMemory
1365303vahagngJobs (BOI24_jobs)C++20
0 / 100
98 ms21420 KiB
#include <bits/stdc++.h>
using namespace std;

const int N = 3e5 + 10;

long long n, s, p[N], a[N], dp[2002][2002];

vector<int> adj[N];
int in[N];

int main(){
    cin >> n >> s;
    for(int i = 1; i <= n; i++){
        cin >> a[i] >> p[i];
        if(p[i]) adj[p[i]].push_back(i), in[i]++;
    }
    long long ans = 0, p = 0;
    for(int i = 1; i <= n; i++){
        if(p + a[i] >= 0){
            p += a[i];
        }else{
            break;
        }
        ans = max(ans, p);
    }
    cout << ans << endl;
}
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...