Submission #2214742


Source Code Expand

#include<cstdio>
#include<cstring>
#include<algorithm>
const int MAXN=5010;
const long long INF=1ll<<61;

struct data
{
	int h,p;
	bool operator<(const data &rsh)const
	{
		return h+p<rsh.h+rsh.p;
	}
}p[MAXN];
long long f[MAXN];

int main()
{
	int n;scanf("%d",&n);
	for(int i=1;i<=n;i++)
	{
		scanf("%d%d",&p[i].h,&p[i].p);
		f[i]=INF;
	}
	std::sort(p+1,p+n+1);
	for(int i=1;i<=n;i++)
		for(int j=n;j;j--)
			if(f[j-1]<=p[i].h)
                f[j]=std::min(f[j],f[j-1]+p[i].p);
	for(;n;n--)
		if(f[n]!=INF)
			break;
	printf("%d\n",n);
	return 0;
}

Submission Info

Submission Time
Task D - Zabuton
User luogu_bot3
Language C++ (GCC 5.4.1)
Score 700
Code Size 584 Byte
Status AC
Exec Time 27 ms
Memory 256 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:19:22: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  int n;scanf("%d",&n);
                      ^
./Main.cpp:22:32: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d",&p[i].h,&p[i].p);
                                ^

Judge Result

Set Name sample All
Score / Max Score 0 / 0 700 / 700
Status
AC × 3
AC × 46
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 128 KB
01-02.txt AC 1 ms 128 KB
01-03.txt AC 2 ms 128 KB
01-04.txt AC 5 ms 256 KB
01-05.txt AC 18 ms 256 KB
01-06.txt AC 19 ms 256 KB
01-07.txt AC 19 ms 256 KB
01-08.txt AC 19 ms 256 KB
01-09.txt AC 19 ms 256 KB
01-10.txt AC 1 ms 128 KB
01-11.txt AC 1 ms 128 KB
01-12.txt AC 8 ms 256 KB
01-13.txt AC 19 ms 256 KB
01-14.txt AC 20 ms 256 KB
01-15.txt AC 20 ms 256 KB
01-16.txt AC 20 ms 256 KB
01-17.txt AC 20 ms 256 KB
01-18.txt AC 20 ms 256 KB
01-19.txt AC 1 ms 128 KB
01-20.txt AC 1 ms 128 KB
01-21.txt AC 12 ms 256 KB
01-22.txt AC 23 ms 256 KB
01-23.txt AC 24 ms 256 KB
01-24.txt AC 23 ms 256 KB
01-25.txt AC 23 ms 256 KB
01-26.txt AC 23 ms 256 KB
01-27.txt AC 24 ms 256 KB
01-28.txt AC 18 ms 256 KB
01-29.txt AC 18 ms 256 KB
01-30.txt AC 18 ms 256 KB
01-31.txt AC 18 ms 256 KB
01-32.txt AC 18 ms 256 KB
01-33.txt AC 20 ms 256 KB
01-34.txt AC 19 ms 256 KB
01-35.txt AC 27 ms 256 KB
01-36.txt AC 26 ms 256 KB
01-37.txt AC 26 ms 256 KB
01-38.txt AC 26 ms 256 KB
01-39.txt AC 26 ms 256 KB
01-40.txt AC 18 ms 256 KB
sample-01.txt AC 1 ms 128 KB
sample-02.txt AC 1 ms 128 KB
sample-03.txt AC 1 ms 128 KB