제출 #626304

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

ho_t1

	
#include <bits/stdc++.h>

#define FIXED_FLOAT(x)  std::fixed <<std::setprecision(20) << (x)
#define all(v) (v).begin(), (v).end()
using namespace  std;
#define forn(i,n) for (int i = 0; i < (n); ++i)
#define rforn(i, n) for(int i = (n) - 1;i >= 0;--i)
#define sz(x) (int)x.size()
#define ff first
#define se second
#define mp make_pair
using ll = long long;
int mod = (ll)1e9 + 7;
const int INF = 1e9 + 1;
const int N = 2e5 + 100;
const double eps = 1e-7;

template <class T> using V = vector<T>;  
template <class T> using VV = V<V<T>>;  
template<class T, size_t SZ> using AR = array<T, SZ>;
template<class T> using PR = pair<T, T>;
template <typename XPAX>
bool ckma(XPAX &x, XPAX y) {
    return (x < y ? x = y, 1 : 0);
}
template <typename XPAX>
bool ckmi(XPAX &x, XPAX y) {
    return (x > y ? x = y, 1 : 0);
}



void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}

template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)


void solve() {
	
	int n;
	cin >> n;
	vector<int> a(n + 1), b(n);
	vector<int> res(n + 1);
	for(int &c : a) cin >> c;
	
	for(int &c : b) cin >> c;
	vector<int> id(n + 1);
	iota(begin(id), end(id), 0);
	sort(begin(id), end(id), [&](int x, int y) {
		return a[x] < a[y];
	});
	
	sort(begin(b), end(b));
	
	multiset<int> st;
	for(int j = 0;j < n;++j) {
		st.insert(max(a[id[j]]-b[j], 0));
	}
	res[id[n]] = *st.rbegin();
	
	for(int j = n - 1;j >= 0;--j) {
		int y = max(a[id[j]] - b[j], 0);
		auto it = st.find(y);
		assert(it != st.end());
		st.erase(it);
		st.insert(max(0, a[id[j+1]]-b[j]));
		res[id[j]] = *st.rbegin();
	}
	for(int &c : res) cout << c << ' ';
	cout << '\n';
		
	

}
void test_case() {
    int t;
    cin >> t;
    forn(p, t) {

        //cout << "Case #" << p + 1 << ": ";
        solve();
    }
}
int main() {

    ios::sync_with_stdio(false);
    cin.tie(0);

    solve();

}

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