1a: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","7961","static/chunks/7961-b9b64ba388cef309.js","3729","static/chunks/3729-8164898f6bdc738c.js","8720","static/chunks/8720-56867bcc82acef59.js","8324","static/chunks/8324-1983729ec379e9d8.js","9211","static/chunks/9211-c08bacb1ba75336f.js","9791","static/chunks/app/submission/%5Bid%5D/page-abe92e013e824763.js"],"CodeViewer"] 1c:I[48988,["6079","static/chunks/363642f4-ca12a5ed7d30075e.js","5653","static/chunks/5653-10777e0e1fc92dce.js","5000","static/chunks/5000-a7bfe5b9669501e3.js","8501","static/chunks/8501-12247bfa9b4a3a0d.js","7961","static/chunks/7961-b9b64ba388cef309.js","3729","static/chunks/3729-8164898f6bdc738c.js","8720","static/chunks/8720-56867bcc82acef59.js","8324","static/chunks/8324-1983729ec379e9d8.js","9211","static/chunks/9211-c08bacb1ba75336f.js","9791","static/chunks/app/submission/%5Bid%5D/page-abe92e013e824763.js"],"TestCaseDisplay"] 1b:T58a,#define _CRT_SECURE_NO_WARNINGS #include #include #include #include #include #define m 100000 //11286 절댓값 힙 typedef struct { int data[m]; int size; }heap; heap* create() { return (heap*)malloc(sizeof(heap)); } void init(heap* h) { h->size = 0; } void insert(heap* h, int d) { int i; i = ++(h->size); while (i != 1 && (abs(d) < abs(h->data[i / 2])|| (abs(d) == abs(h->data[i / 2] && d < h->data[i / 2])))) { h->data[i] = h->data[i / 2]; i /= 2; } h->data[i] = d; } int pop(heap* h) { if (h->size == 0) return 0; int parent = 1, child = 2, d, tem; d = h->data[1]; tem = h->data[h->size--]; while (child <= h->size) { if (child < h->size && (abs(h->data[child + 1]) < abs(h->data[child])) || (abs(h->data[child + 1]) == abs(h->data[child])&& h->data[child + 1] < h->data[child])) { child++; } if (abs(tem) < abs(h->data[child])|| (abs(tem) == abs(h->data[child])&&

제출 #143833

제출 정보

제출 결과

제출 코드

찾은 반례

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력: