제출 #245407

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
245407		kevlee	Just Long Neckties (JOI20_ho_t1)	C++17	100 / 100	344 ms	18556 KiB

ho_t1

#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mod 1000000007
#define h1 7897897897897897
#define h2 7897466719774591
#define b1 98762051
#define b2 98765431
#define inf 1000000000
#define pi 3.1415926535897932384626
#define LMAX 9223372036854775807
#define ll long long
#define fi first
#define se second
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vi vector<int>
#define vl vector<ll>
#define vp vector<pii>
#define SET(a, b) memset(a, b, sizeof(a));
#define all(x) (x).begin(), (x).end()
#define flush fflush(stdout)
#define debug printf("Hello\n")
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define FORD(i, a, b) for (int i = (a); i >= (b); i--)
//priority_queue <int, vector <int>, greater <int> > pq;
int n, m, k, x, y, sum, cnt, ans[200005];
pii a[200005];
int b[200005];
int main () {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cin >> n;
  FOR(i, 1, n+1) {
    cin >> a[i].fi;
    a[i].se = i;
  }
  FOR(i, 1, n) {
    cin >> b[i];
  }
  sort(a+1, a+n+2);
  sort(b+1, b+n+1);
  set <pii> s;
  FOR(i, 1, n) {
    s.insert({max(a[i].fi - b[i], 0), i});
  }
  auto it = s.end();
  it--;
  ans[a[n + 1].se] = it->fi;
  FORD(i, n, 1) {
    auto it = s.find({max(a[i].fi - b[i], 0), i});
    s.erase(it);
    s.insert({max(a[i+1].fi - b[i], 0), i});
    it = s.end();
    it--;
    ans[a[i].se] = it->fi;
  }
  FOR(i, 1, n+1) {
    cout << ans[i] << ' ';
  } 
  cout << endl;
  return 0;
}

• Subtask 1: 1 / 1
• Subtask 2: 8 / 8
• Subtask 3: 91 / 91