# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
25608 | kdh9949 | 스트랩 (JOI14_straps) | C++14 | 23 ms | 17972 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;
struct Str{
int a, v;
bool operator<(const Str &oth) const {
return a > oth.a;
}
};
const int inf = 1e9;
int n, dp[2020][2020];
Str a[2020];
int main(){
scanf("%d", &n);
for(int i = 1; i <= n; i++) scanf("%d%d", &a[i].a, &a[i].v);
sort(a + 1, a + n + 1);
fill(dp[0], dp[0] + n + 1, -inf);
dp[0][1] = 0;
for(int i = 1; i <= n; i++){
for(int j = 0; j <= n; j++) dp[i][j] = dp[i - 1][j];
for(int j = 1; j <= n; j++){
int &ndp = dp[i][min(j + a[i].a - 1, n)];
ndp = max(ndp, dp[i - 1][j] + a[i].v);
}
}
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... |