Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <vector>
- #include <set>
- #include <algorithm>
- using namespace std;
- struct Task {
- int d;
- long long w;
- bool isDelayed = false;
- bool operator<(const Task &r) const {
- if (isDelayed) return w > r.w;
- if (d != r.d) return d > r.d;
- return w > r.w;
- }
- };
- int main() {
- freopen("schedule.in", "r", stdin);
- freopen("schedule.out", "w", stdout);
- int n;
- cin >> n;
- vector <Task> tasks(n);
- set <int, std::greater<int> > deadlineSet;
- deadlineSet.insert(0);
- for (int i = 0; i < n; i++) {
- cin >> tasks[i].d >> tasks[i].w;
- deadlineSet.insert(tasks[i].d);
- }
- sort(tasks.begin(), tasks.end());
- vector <int> deadline;
- for (int d : deadlineSet)
- deadline.push_back(d);
- int it1 = 0, it2 = 0;
- set <Task> delayedTasks;
- for (int i = 0; i < deadline.size() - 1; i++) {
- int curD = deadline[i];
- int prevD = deadline[i + 1];
- while (it2 < n && tasks[it2].d == curD) it2++;
- for (int j = it1; j < it2; j++) {
- tasks[j].isDelayed = true;
- delayedTasks.insert(tasks[j]);
- }
- for (int j = curD; j != prevD && !delayedTasks.empty(); j--)
- delayedTasks.erase(delayedTasks.begin());
- it1 = it2;
- }
- for (int i = 0; i < tasks.size(); i++) {
- if (tasks[i].d == 0) {
- tasks[i].isDelayed = true;
- delayedTasks.insert(tasks[i]);
- }
- }
- long long penalty = 0;
- for (Task t : delayedTasks)
- penalty += t.w;
- cout << penalty;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement