1a:I[10086,["6079","static/chunks/363642f4-ca12a5ed7d30075e.js","5653","static/chunks/5653-10777e0e1fc92dce.js","5000","static/chunks/5000-a7bfe5b9669501e3.js","8501","static/chunks/8501-12247bfa9b4a3a0d.js","643","static/chunks/app/codes/%5Bid%5D/page-56c854ce831bc98e.js"],"AdSenseInsert"] 1b:I[48803,["6079","static/chunks/363642f4-ca12a5ed7d30075e.js","5653","static/chunks/5653-10777e0e1fc92dce.js","5000","static/chunks/5000-a7bfe5b9669501e3.js","8501","static/chunks/8501-12247bfa9b4a3a0d.js","643","static/chunks/app/codes/%5Bid%5D/page-56c854ce831bc98e.js"],"CodeViewer"] 1c:T75f,#include using namespace std; #define int long long vector A, B, cur, up, dn; int last_ans, N; bool solve(int lim) { int l = 0, r = N-1; while(l < N && cur[l] <= lim) { l++; } while(r >= 0 && cur[r] <= lim) { r--; } if(l > r) { // all in cur is better than lim last_ans = A[0]; return 1; } if(l == r) { last_ans = A[l]; return 1; } // l < r int dnl = r; while(dnl >= 0 && dn[dnl] <= lim) { dnl--; } // printf("dnl = %lld, l = %lld, \n", dnl, l); if(dnl <= l) { last_ans = A[dnl]; return 1; } int cnt = 0, pos; for(int i=l; i<=r; i++) { if(cur[i] > lim) { pos = i; cnt++; } } if(cnt == 1) { last_ans = A[pos]; return 1; } bool ok = 1; for(int i=l; i lim) { ok = 0; break; } } if(ok) { last_ans = A[r]; return 1; } last_ans = -1; return 0; } int32_t main() { cin.tie(0)->sync_with_stdio(0); cin >> N; A = B = cur = up = dn = vector(N); for(int i=0; i> A[i]; } for(int i=0; i> B[i]; } sort(A.begin(), A.end()); sort(B.begin(), B.end()); for(int i=0; i

코드 #5150