제출 #955265

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
955265		yellowtoad	스트랩 (JOI14_straps)	C++17	100 / 100	14 ms	32348 KiB

straps

#include <iostream>
#include <algorithm>
#define f first
#define s second
using namespace std;

long long n, x, y, dp[2010][2010], maxx;
pair<long long,long long> a[2010];

int main() {
	cin >> n;
	for (int i = 1; i <= n; i++) cin >> a[i].f >> a[i].s;
	sort(a+1,a+n+1,greater<pair<long long,long long>>());
	dp[0][0] = -1e18;
	for (int i = 2; i <= n; i++) dp[0][i] = -1e18;
	for (int i = 1; i <= n; i++) {
		x = a[i].f; y = a[i].s;
		for (int j = 0; j < n; j++) {
			dp[i][j] = dp[i-1][j];
			if (j-x+1 >= 0) dp[i][j] = max(dp[i][j],dp[i-1][j-x+1]+y);
		}
		dp[i][n] = dp[i-1][n];
		for (int j = n-x+1; j <= n; j++) dp[i][n] = max(dp[i][n],dp[i-1][j]+y);
	}
	for (int i = 0; i <= n; i++) maxx = max(maxx,dp[n][i]);
	cout << maxx << endl;
}

• Subtask 1: 5 / 5
• Subtask 2: 5 / 5
• Subtask 3: 45 / 45
• Subtask 4: 45 / 45