1a:I[48803,["6079","static/chunks/363642f4-ca12a5ed7d30075e.js","5653","static/chunks/5653-10777e0e1fc92dce.js","5000","static/chunks/5000-a7bfe5b9669501e3.js","8501","static/chunks/8501-12247bfa9b4a3a0d.js","7961","static/chunks/7961-b9b64ba388cef309.js","3729","static/chunks/3729-8164898f6bdc738c.js","8720","static/chunks/8720-56867bcc82acef59.js","8324","static/chunks/8324-1983729ec379e9d8.js","9211","static/chunks/9211-c08bacb1ba75336f.js","9791","static/chunks/app/submission/%5Bid%5D/page-abe92e013e824763.js"],"CodeViewer"] 1c:I[48988,["6079","static/chunks/363642f4-ca12a5ed7d30075e.js","5653","static/chunks/5653-10777e0e1fc92dce.js","5000","static/chunks/5000-a7bfe5b9669501e3.js","8501","static/chunks/8501-12247bfa9b4a3a0d.js","7961","static/chunks/7961-b9b64ba388cef309.js","3729","static/chunks/3729-8164898f6bdc738c.js","8720","static/chunks/8720-56867bcc82acef59.js","8324","static/chunks/8324-1983729ec379e9d8.js","9211","static/chunks/9211-c08bacb1ba75336f.js","9791","static/chunks/app/submission/%5Bid%5D/page-abe92e013e824763.js"],"TestCaseDisplay"] 1b:T575,#include #include #include #include using namespace std; struct Data { int start, end; bool operator < (const Data& other) const { return start < other.start || (start == other.start && end < other.end); } bool operator > (const Data& other) const { return start > other.start || (start == other.start && start > other.end); } }; struct Class { priority_queue, greater> q; vector DataList; int count = 0; void AddClass(int start, int end) { DataList.push_back({start, end}); } void Scheduling() { sort(DataList.begin(), DataList.end()); // for(int i = 0; i < DataList.size(); i++) // { // cout << DataList[i].start << " " << DataList[i].end << "\n"; // } for(auto& data : DataList) { if(!q.empty() && q.top().end <= data.start) {

제출 #92872

제출 정보

제출 결과

제출 코드

찾은 반례

입력:

오답 출력:

정답 출력: