Submission #8537443


Source Code Expand

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;

ll dp[15000];

signed main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << fixed << setprecision(20);
    
    ll n,t;
    cin>>n>>t;
    array<ll,2> a[n];
    for(int i=0;i<n;i++){
        ll x,y;
        cin>>x>>y;
        a[i] = {x,y};
    }
    sort(a,a+n);
  	reverse(a,a+n);
    ll ans = 0;
    for(int i=0;i<n;i++){
        for(int j=t+a[i][0];j>=a[i][0];j--){
            dp[j] = max(dp[j],dp[j-a[i][0]]+a[i][1]);
            ans = max(ans,dp[j]);
        }
    }
    cout << ans << endl;
}

Submission Info

Submission Time
Task C - おやつ
User totori0908
Language C++14 (GCC 5.4.1)
Score 100
Code Size 611 Byte
Status AC
Exec Time 36 ms
Memory 384 KB

Judge Result

Set Name Sample Subtask1 Subtask2
Score / Max Score 0 / 0 50 / 50 50 / 50
Status
AC × 3
AC × 17
AC × 38
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt
Subtask1 sample_01.txt, sample_02.txt, subtask1_00.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt
Subtask2 sample_01.txt, sample_02.txt, sample_03.txt, subtask1_00.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask2_00.txt, subtask2_01.txt, subtask2_02.txt, subtask2_03.txt, subtask2_04.txt, subtask2_05.txt, subtask2_06.txt, subtask2_07.txt, subtask2_08.txt, subtask2_09.txt, subtask2_10.txt, subtask2_11.txt, subtask2_12.txt, subtask2_13.txt, subtask2_14.txt, subtask2_15.txt, subtask2_16.txt, subtask2_17.txt, subtask2_18.txt, subtask2_19.txt
Case Name Status Exec Time Memory
sample_01.txt AC 1 ms 256 KB
sample_02.txt AC 1 ms 256 KB
sample_03.txt AC 1 ms 256 KB
subtask1_00.txt AC 1 ms 256 KB
subtask1_01.txt AC 1 ms 256 KB
subtask1_02.txt AC 1 ms 256 KB
subtask1_03.txt AC 1 ms 256 KB
subtask1_04.txt AC 1 ms 256 KB
subtask1_05.txt AC 1 ms 256 KB
subtask1_06.txt AC 1 ms 256 KB
subtask1_07.txt AC 1 ms 256 KB
subtask1_08.txt AC 1 ms 256 KB
subtask1_09.txt AC 1 ms 256 KB
subtask1_10.txt AC 1 ms 256 KB
subtask1_11.txt AC 1 ms 256 KB
subtask1_12.txt AC 1 ms 256 KB
subtask1_13.txt AC 1 ms 256 KB
subtask1_14.txt AC 1 ms 256 KB
subtask2_00.txt AC 4 ms 256 KB
subtask2_01.txt AC 7 ms 256 KB
subtask2_02.txt AC 26 ms 384 KB
subtask2_03.txt AC 5 ms 256 KB
subtask2_04.txt AC 9 ms 384 KB
subtask2_05.txt AC 20 ms 384 KB
subtask2_06.txt AC 2 ms 256 KB
subtask2_07.txt AC 4 ms 256 KB
subtask2_08.txt AC 2 ms 256 KB
subtask2_09.txt AC 7 ms 256 KB
subtask2_10.txt AC 36 ms 384 KB
subtask2_11.txt AC 36 ms 384 KB
subtask2_12.txt AC 36 ms 384 KB
subtask2_13.txt AC 36 ms 384 KB
subtask2_14.txt AC 36 ms 384 KB
subtask2_15.txt AC 36 ms 384 KB
subtask2_16.txt AC 36 ms 384 KB
subtask2_17.txt AC 36 ms 384 KB
subtask2_18.txt AC 36 ms 384 KB
subtask2_19.txt AC 36 ms 384 KB