c++——pow_na——Exam in BerSU (easy version)

本题为一个简单的考试模拟问题,共有n名学生参加,考试时间总计M分钟。每位学生答题时间不同,若超过时间则视为不及格。题目要求求出每名学生通过考试所需的最少不及格人数。输入包含学生数量n和考试总时间M,以及每位学生的答题时间。输出为每名学生对应的最少不及格人数。
摘要由CSDN通过智能技术生成

题目描述

The only difference between easy and hard versions is constraints.

A session has begun at Beland State University. Many students are taking exams.

Polygraph Poligrafovich is going to examine a group of nn students. Students will take the exam one-by-one in order from 11 -th to nn -th. Rules of the exam are following:

  • The ii -th student randomly chooses a ticket.
  • if this ticket is too hard to the student, he doesn't answer and goes home immediately (this process is so fast that it's considered no time elapses). This student fails the exam.
  • if the student finds the ticket easy, he spends exactly t_iti​ minutes to pass the exam. After it, he immediately gets a mark and goes home.

Students take the exam in the

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值