# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1094572 | Izzy | Advertisement 2 (JOI23_ho_t2) | C++14 | 296 ms | 4340 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
using namespace std;
//https://pastebin.com/LckN30bC
// keep values of x + e, x - e; sort by left and then right
int n;
bool compare(const pair<int, int> &a, const pair<int, int> &b) {
if (a.first != b.first) {
return a.first < b.first;
}
return a.second > b.second; // 1 4, 1 3, 1 2
}
int main() {
cin >> n;
vector<pair<int, int>> range(n);
int x, e;
for (int i = 0; i < n; i++) {
cin >> x >> e;
range[i].first = x - e;
range[i].second = x + e;
}
sort(range.begin(), range.end(), compare);
int maximum = -1;
int answer = 0;
for (int i = 0; i < n; i++) {
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |