# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
157325 | karma | 스트랩 (JOI14_straps) | C++14 | 26 ms | 16120 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>
#define FileName "test"
#define ll long long
#define pb emplace_back
#define deg first
#define c second
using namespace std;
typedef pair<int, int> pii;
const int N = int(2e3) + 2;
const int oo = int(2e9) + 7;
int f[N][N], a[N];
int n, res = 0, nxt;
pii val[N];
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
if(fopen(FileName".inp", "r")) {
freopen(FileName".inp", "r", stdin);
freopen(FileName".out", "w", stdout);
}
cin >> n;
for(int i = 1; i <= n; ++i) cin >> val[i].deg >> val[i].c;
sort(val + 1, val + n + 1);
for(int i = 1; i <= n; ++i) {
for(int j = 0; j <= n; ++j) {
f[i][j] = max(f[i - 1][j], (j ? f[i - 1][min(j - 1 + val[i].deg, n)] + val[i].c: 0));
}
}
cout << f[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... |