제출 #374894

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
374894		peijar	Just Long Neckties (JOI20_ho_t1)	C++17	9 / 100	1071 ms	9964 KiB

ho_t1

#include <bits/stdc++.h>
#define int long long
using namespace std;

/*
 * Si prend plus petit : cout = 0
 * sinon cout > 0
 * Si N de chaque côté :
 * a_1 <= ... <= a_n
 * b_1 <= ... <= b_n
 * Si b_1 <= a_1 : mieux de mettre avec a_1
 * Sinon b_1 > a_1 : 
 * SI on met a_1 avec b_i, i > 1 et b_1 avec j, j > 1
 * cout : max(bi - a1, max(b1 - aj, 0))
 * S max(bi-aj, 0) = 0 : mieux echanger
 * Tri par ordre croissant !
 */
signed main(void)
{
	ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);

	int N;
	cin >> N;
	vector<pair<int, int>> A(N+1);
	vector<int>  B(N);
	for (int i(0); i <= N; ++i)
	{
		cin >> A[i].first;
		A[i].second = i;
	}
	for (auto &v : B) cin >> v;
	sort(A.begin(), A.end());
	sort(B.begin(), B.end());
	vector<int> sol(N+1);
	for (int toSkip(0); toSkip <= N; ++toSkip)
		for (int i(0); i < N; ++i)
			sol[A[toSkip].second] = max(sol[A[toSkip].second], -B[i] + A[i + (toSkip<=i)].first);
	for (auto v: sol)
		cout << v<< ' ';
	cout << endl;
}

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