| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 32111 | TAMREF | 스트랩 (JOI14_straps) | C++11 | 33 ms | 33436 KiB | 
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
using ii = pair<int,int>;
const int ilb = INT_MIN;
int dp[2005][2005], vis[2005][2005];
ii f[2005];
int n;
void input(){
    scanf("%d",&n);
    for(int i=0;i<n;i++) scanf("%d %d",&f[i].first,&f[i].second);
    sort(f,f+n,greater<ii>());
    for(int i=0;i<=n;i++) for(int j=0;j<=n;j++) dp[i][j]=ilb;
    dp[0][1]=0;
}
void work(){
    for(int i=0;i<n;i++){
        for(int j=0,k;j<=n;j++){
            dp[i+1][j]=max(dp[i+1][j],dp[i][j]);
            k=min(n,j+f[i].first-1);
            if(j && dp[i][j]!=ilb) dp[i+1][k]=max(dp[i+1][k],dp[i][j]+f[i].second);
        }
    }
}
int main(){
    input();
    work();
    printf("%d\n",*max_element(dp[n],dp[n]+n+1));
}
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
