Submission #869198

#	Time	Username	Problem	Language	Result	Execution time	Memory
869198		goodspeed0208	Just Long Neckties (JOI20_ho_t1)	C++14	0 / 100	0 ms	348 KiB

ho_t1

#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;

int main() {
	int n;
	cin >> n;
	vector<int>a(n+1), b(n);
	vector<int>ans(n);
	for (auto &i : a) cin >> i;
	for (auto &i : b) cin >> i;
	sort(a.begin(), a.end());
	sort(b.begin(), b.end());
	for (int i = 0 ; i < n ; i++) {
		ans[i] = a[i+1] - b[i];
	}
	for (int i = 0 ; i < n+1 ; i++) {
		cout << *max_element(ans.begin(), ans.end()) << " ";
		if (i == n) break;
		ans[i] = a[i] - b[i];
	} 
}

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