hdu 1789 doing homework again

这篇博客介绍了如何解决HDU 1789题目的思路,涉及模拟和使用vector来存储不同期限的作业扣分情况。通过遍历并检查每个期限,利用优先级队列来确定未完成作业的最大累计扣分。作者在描述过程中提到在不同平台上提交代码得到了不同的结果,表示对于某些情况的理解存在困惑。
摘要由CSDN通过智能技术生成

http://acm.hdu.edu.cn/showproblem.php?pid=1789

Doing Homework again

Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 1861 Accepted Submission(s): 1097


Problem Description
Ignatius has just come back school from the 30th ACM/ICPC. Now he has a lot of homework to do. Every teacher gives him a deadline of handing in the homework. If Ignatius hands in the homework after the deadline, the teacher will reduce his score of the final test. And now we assume that doing every
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值