제출 #781567

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

ho_t1

#include <bits/stdc++.h>

using namespace std;

typedef long long lo; 

#define fi first
#define se second
#define endl "\n"
#define pb push_back
#define fio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define FOR for(int i=1;i<=n;i++)
#define mid ((start+end)/2)
#define ort ((bas+son)/2)

const lo inf = 1000000000;
const lo li = 500005;
const lo mod = 1000000007;

int n,m,a[li],k,flag,t,cevap[li];
int cev;
pair<int,int> b[li];
string s;
vector<int> v;

inline int in(){
	int x;
	scanf("%d",&x);
	return x;
}

int main(void){
	n=in();
	for(int i=1;i<=n+1;i++){
		b[i].fi=in();
		b[i].se=i;
	}
	FOR a[i]=in();
	sort(a+1,a+n+1);
	sort(b+1,b+n+2);
	multiset<int> st;
	for(int i=1;i<=n;i++){
		st.insert(max(0,b[i].fi-a[i]));
	}
	auto it=st.end();
	it--;
	cevap[b[n+1].se]=*it;
	for(int i=n;i>=1;i--){
		st.erase(st.find(max(0,b[i].fi-a[i])));
		st.insert(max(0,b[i+1].fi-a[i]));
		it=st.end();
		it--;
		cevap[b[i].se]=*it;
	}
	for(int i=1;i<=n+1;i++)printf("%d ",cevap[i]);
	return 0;
}

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

ho_t1.cpp: In function 'int in()':
ho_t1.cpp:28:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   28 |  scanf("%d",&x);
      |  ~~~~~^~~~~~~~~

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