# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
759661 | raysh07 | Advertisement 2 (JOI23_ho_t2) | C++17 | 145 ms | 24572 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 <bits/stdc++.h>
using namespace std;
#define int long long
#define INF (int)1e18
#define f first
#define s second
mt19937_64 RNG(chrono::steady_clock::now().time_since_epoch().count());
void Solve()
{
int n;
cin>>n;
vector <pair<int, int>> v;
int x[n], e[n];
for (int i=0; i<n; i++)
cin>>x[i]>>e[i];
for (int i=0; i<n; i++){
v.push_back({x[i] - e[i] , x[i] + e[i]});
}
sort(v.begin(), v.end());
int best = -INF;
int c = 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... |