제출 #1313336

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1313336		nicolo_010	Just Long Neckties (JOI20_ho_t1)	C++20	9 / 100	1095 ms	4436 KiB

ho_t1

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
#define f first
#define s second

int main() {
	ios::sync_with_stdio(false);
	cin.tie(NULL);
	int n; cin >> n;
	vector<int> a(n+1);
	for (int i=0; i<=n; i++) {
		cin >> a[i];
	}
	vector<int> b(n);
	for (int i=0; i<n; i++) {
		cin >> b[i];
	}
	vector<int> ans(n+1);
	for (int i=0; i<=n; i++) {
		vector<int> c;
		for (int j=0; j<=n; j++) {
			if (j==i) continue;
			c.push_back(a[j]);
		}
		sort(c.begin(), c.end());
		sort(b.begin(), b.end());
		int ck = 0;
		for (int i=0; i<n; i++) {
			ck = max(ck, max(0, c[i]-b[i]));
		}
		ans[i] = ck;
	}
	for (auto x : ans) {
		cout << x << " ";
	}
	cout << "\n";
}

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