Submission #2195463
Source Code Expand
#include<bits/stdc++.h> using namespace std; #define fi first #define sc second typedef long long ll; typedef pair<ll,ll> pll; #define MAX_N 5000 const ll inf=1000000000000000000; pll a[MAX_N]; ll dp[MAX_N][MAX_N+1]; bool cmp(pll a,pll b){ return a.fi+a.sc<b.fi+b.sc; } int main(){ int n; scanf("%d",&n); for(int i=0;i<n;++i) cin>>a[i].fi>>a[i].sc; sort(a,a+n,cmp); dp[0][0]=0; dp[0][1]=a[0].sc; for(int i=1;i<n;++i){ dp[i][0]=0; if(a[i].fi>=dp[i-1][i]) dp[i][i+1]=dp[i-1][i]+a[i].sc; else dp[i][i+1]=inf; for(int j=1;j<=i;++j){ if(a[i].fi>=dp[i-1][j-1]) dp[i][j]=min(dp[i-1][j],dp[i-1][j-1]+a[i].sc); else dp[i][j]=dp[i-1][j]; } } for(int i=0;i<=n;++i) if(dp[n-1][i]>=inf){ printf("%d\n",i-1); return 0; } printf("%d\n",n); return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - Zabuton |
User | neander |
Language | C++14 (GCC 5.4.1) |
Score | 700 |
Code Size | 812 Byte |
Status | AC |
Exec Time | 59 ms |
Memory | 193920 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:20:16: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d",&n); ^
Judge Result
Set Name | sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 700 / 700 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
sample | sample-01.txt, sample-02.txt, sample-03.txt |
All | sample-01.txt, sample-02.txt, sample-03.txt, 01-01.txt, 01-02.txt, 01-03.txt, 01-04.txt, 01-05.txt, 01-06.txt, 01-07.txt, 01-08.txt, 01-09.txt, 01-10.txt, 01-11.txt, 01-12.txt, 01-13.txt, 01-14.txt, 01-15.txt, 01-16.txt, 01-17.txt, 01-18.txt, 01-19.txt, 01-20.txt, 01-21.txt, 01-22.txt, 01-23.txt, 01-24.txt, 01-25.txt, 01-26.txt, 01-27.txt, 01-28.txt, 01-29.txt, 01-30.txt, 01-31.txt, 01-32.txt, 01-33.txt, 01-34.txt, 01-35.txt, 01-36.txt, 01-37.txt, 01-38.txt, 01-39.txt, 01-40.txt, sample-01.txt, sample-02.txt, sample-03.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
01-01.txt | AC | 1 ms | 256 KB |
01-02.txt | AC | 1 ms | 512 KB |
01-03.txt | AC | 12 ms | 47616 KB |
01-04.txt | AC | 24 ms | 94720 KB |
01-05.txt | AC | 55 ms | 193792 KB |
01-06.txt | AC | 56 ms | 193792 KB |
01-07.txt | AC | 56 ms | 193920 KB |
01-08.txt | AC | 55 ms | 193920 KB |
01-09.txt | AC | 55 ms | 193920 KB |
01-10.txt | AC | 1 ms | 256 KB |
01-11.txt | AC | 9 ms | 35328 KB |
01-12.txt | AC | 31 ms | 115200 KB |
01-13.txt | AC | 54 ms | 188928 KB |
01-14.txt | AC | 56 ms | 193792 KB |
01-15.txt | AC | 56 ms | 193920 KB |
01-16.txt | AC | 56 ms | 193920 KB |
01-17.txt | AC | 56 ms | 193792 KB |
01-18.txt | AC | 56 ms | 193792 KB |
01-19.txt | AC | 1 ms | 384 KB |
01-20.txt | AC | 8 ms | 29184 KB |
01-21.txt | AC | 37 ms | 133632 KB |
01-22.txt | AC | 57 ms | 193408 KB |
01-23.txt | AC | 57 ms | 193792 KB |
01-24.txt | AC | 57 ms | 193792 KB |
01-25.txt | AC | 57 ms | 193792 KB |
01-26.txt | AC | 57 ms | 193792 KB |
01-27.txt | AC | 57 ms | 193920 KB |
01-28.txt | AC | 54 ms | 193792 KB |
01-29.txt | AC | 54 ms | 193792 KB |
01-30.txt | AC | 54 ms | 193920 KB |
01-31.txt | AC | 54 ms | 193920 KB |
01-32.txt | AC | 54 ms | 193920 KB |
01-33.txt | AC | 55 ms | 193792 KB |
01-34.txt | AC | 55 ms | 193920 KB |
01-35.txt | AC | 59 ms | 193792 KB |
01-36.txt | AC | 59 ms | 193792 KB |
01-37.txt | AC | 59 ms | 193792 KB |
01-38.txt | AC | 59 ms | 193792 KB |
01-39.txt | AC | 59 ms | 193792 KB |
01-40.txt | AC | 55 ms | 193920 KB |
sample-01.txt | AC | 1 ms | 256 KB |
sample-02.txt | AC | 1 ms | 256 KB |
sample-03.txt | AC | 1 ms | 256 KB |