제출 #1023787

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

ho_t1

#include "bits/stdc++.h"
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx,avx2,fma")
using namespace std;
#define vec vector
#define int long long
#define inf 1e18
const int mod = 998244353 , men = 1e9 + 7;
/*
▀█████████▄   ▄█   ▄█          ▄████████  ▄█        ▄████████  ▄██████▄  ████████▄     ▄████████    ▄████████ 
  ███    ███ ███  ███         ███    ███ ███       ███    ███ ███    ███ ███   ▀███   ███    ███   ███    ███ 
  ███    ███ ███▌ ███         ███    ███ ███       ███    █▀  ███    ███ ███    ███   ███    █▀    ███    ███ 
 ▄███▄▄▄██▀  ███▌ ███         ███    ███ ███       ███        ███    ███ ███    ███  ▄███▄▄▄      ▄███▄▄▄▄██▀ 
▀▀███▀▀▀██▄  ███▌ ███       ▀███████████ ███       ███        ███    ███ ███    ███ ▀▀███▀▀▀     ▀▀███▀▀▀▀▀   
  ███    ██▄ ███  ███         ███    ███ ███       ███    █▄  ███    ███ ███    ███   ███    █▄  ▀███████████ 
  ███    ███ ███  ███▌    ▄   ███    ███ ███▌    ▄ ███    ███ ███    ███ ███   ▄███   ███    ███   ███    ███ 
▄█████████▀  █▀   █████▄▄██   ███    █▀  █████▄▄██ ████████▀   ▀██████▀  ████████▀    ██████████   ███    ███ 
				  ▀                      ▀                                                         ███    ███ 
*/
template<typename _T>
bool chmin(_T &a, const _T &b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template <typename _T>
bool chmax(_T &a, const _T &b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
double dist(double x1 , double y1 , double x2 , double y2){
	return sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2));	
}
inline void io(){
	ios_base::sync_with_stdio(false);
	cin.tie(nullptr);
	cout.tie(nullptr);
}
inline void solve(){
	int n;
	cin >> n;
	vector<int> a(n + 1) , b(n);
	for (auto & x : a)
		cin >> x;
	for (auto & x : b)
		cin >> x;
	sort(b.begin() , b.end());
	for (int i = 0; i <= n; i++){
		int res = 0;
		vector<int> aa = a;
		aa.erase(aa.begin() + i);
		sort(aa.begin() , aa.end());
		for (int i = 0; i < n; i++)
			chmax(res , aa[i] - b[i]);
		cout << res << " ";
	}
}
signed main() {
	io();
    int t = 1;
    //~ cin >> t;
    while(t--)
        solve();
    return 0;
}

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