제출 #1060392

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1060392		khanhtb	Just Long Neckties (JOI20_ho_t1)	C++14	100 / 100	195 ms	21844 KiB

ho_t1

#include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define ld long double
#define pb push_back
#define pf push_front
#define vi vector<ll>
#define vii vector<vi>
#define pll pair<ll, ll>
#define vpll vector<pll>
#define all(a) a.begin(), a.end()
#define fi first
#define se second
using namespace std;
const ll mod = 1e9+7; 
const ll inf = 2e18;
const ll B = 320;
const ll N = 2e5+8;
ll n,b[N],ans[N];
pair<ll,ll> a[N];
void solve(){
    cin >> n;
    multiset<ll> s;
    for(ll i = 1; i <= n+1; i++) cin >> a[i].fi, a[i].se = i;
    for(ll i = 1; i <= n; i++) cin >> b[i];
    sort(a+1,a+n+2),sort(b+1,b+n+1);
    for(ll i = 1; i <= n; i++){
        s.insert(max(a[i+1].fi - b[i],0LL));
    }
    for(ll i = 1; i <= n+1; i++){
        ans[a[i].se] = *s.rbegin();
        if(i <= n){
            s.erase(s.find(max(a[i+1].fi - b[i],0LL)));
            s.insert(max(a[i].fi - b[i],0LL));
        }
    }
    for(ll i = 1; i <= n+1; i++) cout << ans[i] << " ";
} 
signed main(){
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    if (fopen("test.inp", "r")) {
        freopen("test.inp", "r", stdin);
        freopen("test.out", "w", stdout);
    }   
    ll T = 1;
    // cin >> T;
    for (ll i = 1; i <= T; i++) {
        solve();
        cout << '\n';
    }
}

컴파일 시 표준 에러 (stderr) 메시지

ho_t1.cpp: In function 'int main()':
ho_t1.cpp:42:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   42 |         freopen("test.inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
ho_t1.cpp:43:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   43 |         freopen("test.out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

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