# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
891893 | goodspeed0208 | Art Exhibition (JOI18_art) | C++14 | 291 ms | 56372 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<algorithm>
#include<set>
#include<map>
#include<utility>
#define int long long
#define INF 1000000000000000000
#define pii pair<long long, long long>
using namespace std;
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<pii>v(n);
for(int i = 0 ; i < n ; i++) cin >> v[i].first >> v[i].second;
sort(v.begin(), v.end());
vector<int>psum(n);
psum[0] = v[0].second;
for (int i = 1 ; i < n ; i++) psum[i] = psum[i-1] + v[i].second;
int start = 0, end = n-1;
set<pii>st;
st.insert({0, n-1});
for (int i = n-2 ; i >= 0 ; i--) {
int t = (v[n-1].first - v[i].first) - (psum[n-1] - psum[i]);
st.insert({t, i});
/*if (v[n-1].first - v[i].first > psum[n-1] - psum[i]) end = i;
Compilation message (stderr)
# | 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... |