第k大的数

状态	递交者	时间	内存	语言	代码	递交时间
AC	胡宸华 (huchenhua)	15ms	256 KiB		311 Bytes	2022-2-18 21:20:30
AC	qwertyuiop	16ms	356 KiB		249 Bytes	2022-2-18 21:17:44
AC	Zongzi1	22ms	6.6 MiB	C++17(O2)	262 Bytes	2024-7-27 18:37:00
AC	liangyuntian	22ms	6.9 MiB		295 Bytes	2023-9-9 18:06:57
AC	赵沛喆	22ms	580 KiB		231 Bytes	2022-8-17 15:42:27
AC	朱老师 (zyp)	22ms	6.7 MiB		360 Bytes	2023-9-9 17:58:06
AC	南坪校区-崔艺宸 (崔艺宸)	22ms	6.9 MiB		277 Bytes	2023-9-9 18:07:47
AC	真的高兴(死)了 (huyunyi1)	22ms	6.9 MiB		400 Bytes	2023-9-9 18:02:18
AC	南坪校区-郑力博 (zhenglibo23003)	22ms	6.9 MiB		397 Bytes	2023-9-9 18:07:14
AC	My name is Man (钟卓劭)	23ms	6.8 MiB	C++98	251 Bytes	2024-8-9 14:49:36
AC	赵鑫宸 (xiaoxiao721)	23ms	456 KiB		695 Bytes	2022-3-24 17:28:40
AC	huanglu	23ms	6.8 MiB	C++98	528 Bytes	2024-5-23 13:58:58
AC	只因 (yubohang23002)	23ms	6.9 MiB		403 Bytes	2023-9-9 18:03:33
AC	周靖淞 (zhoujingsong)	23ms	6.9 MiB	C++98(O2)	276 Bytes	2024-8-21 14:19:11
AC	曹埊睿 (caodirui)	24ms	384 KiB		419 Bytes	2023-4-24 19:57:29
AC	赵泳鑫 (zhaoyongxin)	24ms	392 KiB		293 Bytes	2022-5-14 19:43:00
AC	黄立信	25ms	384 KiB		412 Bytes	2023-1-12 10:22:11
AC	陈星宇	25ms	392 KiB		317 Bytes	2023-1-12 10:25:09
AC	黄立信	25ms	412 KiB		447 Bytes	2023-1-12 10:25:27
AC	疯神芭芭脱丝 (李卓修)	26ms	512 KiB		278 Bytes	2022-7-12 11:27:25
AC	缥 (王硕2012)	26ms	432 KiB		432 Bytes	2023-4-2 15:47:45
AC	黄立信	26ms	512 KiB		409 Bytes	2023-1-12 10:21:27
AC	zlx (xiao)	26ms	460 KiB		323 Bytes	2022-11-26 19:34:00
AC	陈海骞 (chq)	26ms	432 KiB		268 Bytes	2022-7-25 20:00:40
AC	南坪校区-崔艺宸 (崔艺宸)	26ms	6.9 MiB		351 Bytes	2023-9-9 18:13:39
AC	胡瀚文	27ms	544 KiB		258 Bytes	2022-7-16 9:43:55
AC	经常消失 (小萝卜)	27ms	392 KiB		296 Bytes	2022-6-4 14:09:40
AC	CPL	27ms	384 KiB		281 Bytes	2022-6-4 14:09:43
AC	leisixian (22029-lyh)	27ms	448 KiB		219 Bytes	2023-4-2 9:37:45
AC	中岛敦 (黄麒瑞)	27ms	6.8 MiB		229 Bytes	2023-10-15 10:40:54
AC	廖海宇在追杀马牌痞 (liaohaiyu22031)	27ms	424 KiB		208 Bytes	2023-4-2 9:23:20
AC	荣耀	27ms	6.7 MiB		187 Bytes	2023-8-30 15:03:20
AC	文硕 (文硕1)	27ms	436 KiB		293 Bytes	2022-7-12 13:52:03
AC	x0l0x	28ms	6.8 MiB		259 Bytes	2023-10-3 12:25:02
AC	luoluonuoya	28ms	512 KiB		349 Bytes	2022-4-26 18:40:30
AC	喵 (蹇心悦)	28ms	440 KiB		249 Bytes	2022-10-29 16:47:51
AC	曾御城（现用名） (Jason)	28ms	452 KiB		859 Bytes	2022-6-1 19:00:51
AC	正常的雪糕	28ms	6.7 MiB		203 Bytes	2023-8-21 17:25:12
AC	李树崑 (lishukun)	28ms	452 KiB		283 Bytes	2022-6-4 14:17:12
AC	杜俊宏	28ms	456 KiB		315 Bytes	2022-6-26 18:15:39
AC	黄立信	28ms	452 KiB		447 Bytes	2023-1-12 10:30:09
AC	张泰凌 (ztl)	28ms	392 KiB		298 Bytes	2022-6-11 11:33:44
AC	ywh	28ms	476 KiB		255 Bytes	2022-6-11 11:24:56
AC	我是2b+傻逼 (chenyuxuan)	28ms	384 KiB		197 Bytes	2023-3-18 9:05:28
AC	朱老师 (zyp)	28ms	416 KiB		292 Bytes	2022-9-28 16:34:26
AC	啊...这 (炼狱杏寿郎)	29ms	452 KiB		242 Bytes	2022-6-4 14:16:09
AC	yang	29ms	512 KiB		272 Bytes	2022-8-31 13:07:35
AC	朱老师 (zyp)	29ms	6.7 MiB		223 Bytes	2023-8-21 17:24:11
AC	李山水	29ms	460 KiB		304 Bytes	2022-2-16 17:32:08
AC	杜是贤 (dushixian)	29ms	512 KiB		201 Bytes	2023-5-28 10:56:03
AC	赵一嵘 (zhaoyirong)	29ms	440 KiB		230 Bytes	2022-6-4 14:16:09
AC	李树崑 (lishukun)	29ms	440 KiB		267 Bytes	2022-8-19 21:14:48
AC	renqiumo	29ms	512 KiB		1.1 KiB	2022-5-29 15:09:23
AC	罗翌珂 (dangdang)	29ms	476 KiB		308 Bytes	2022-9-6 22:29:37
AC	不怎么聪明的家伙 (贺俊楠)	29ms	6.7 MiB		229 Bytes	2023-8-30 16:57:17
AC	李彭宋代诗人 (ljy123456)	29ms	384 KiB		293 Bytes	2023-4-6 21:10:44
AC	偽艺術家 (chenyanchi22006)	30ms	512 KiB		247 Bytes	2022-9-27 21:35:59
AC	ycy	30ms	384 KiB		285 Bytes	2022-8-7 15:39:15
AC	嘉宝 (王淳恺)	30ms	6.7 MiB		234 Bytes	2023-8-29 17:44:31
AC	手搓STL stack 双向无环链表 _ 向量 2种实现方式: template <typename Map_Type> class Stack_l /* Stack _ List / { private: struct Node { Map_Type Node_Data; Node nextp, lastp; Node(void) { nextp = 0; lastp = 0; } }; struct List_Data { unsigned int List_Size; Node headp, endp; List_Data(void) { List_Size = 0; headp = 0; endp = 0; } }Data; struct Vector_Data { Map_Type headp, lastp, endp; void resize(unsigned int data_size) { Map_Type newp = new Map_Type[data_size](); endp = newp + data_size - 1; lastp = newp + (data_size > lastp - headp ? lastp - headp : data_size); if (headp) delete[] headp; headp = newp; } Vector_Data(void) { headp = 0; lastp = 0; endp = 0; } }; public: unsigned int size(void) { return Data.List_Size; } Map_Type& top(void) { return Data.endp -> Node_Data; } void data(void) { return &Data; } bool empty(void) { return !((bool)Data.headp); } Stack_l<Map_Type>& push(Map_Type push_data) { Node nodep = new Node(); nodep -> lastp = Data.endp; if (!Data.headp) { Data.headp = nodep; Data.endp = nodep; } else Data.endp -> nextp = nodep; Data.endp = nodep; nodep -> Node_Data = push_data; ++Data.List_Size; return this; } Stack_l<Map_Type>& push(Map_Type& push_data) { Node nodep = new Node(); nodep -> lastp = Data.endp; if (!Data.headp) { Data.headp = nodep; Data.endp = nodep; } else Data.endp -> nextp = nodep; Data.endp = nodep; nodep -> Node_Data = push_data; ++Data.List_Size; return this; } Stack_l<Map_Type>& push(Map_Type* push_data) { Node nodep = new Node(); nodep -> lastp = Data.endp; if (!Data.headp) { Data.headp = nodep; Data.endp = nodep; } else Data.endp -> nextp = nodep; Data.endp = nodep; nodep -> Node_Data = push_data; ++Data.List_Size; return this; } Stack_l<Map_Type>& push(const Map_Type push_data) { Node nodep = new Node(); nodep -> lastp = Data.endp; if (!Data.headp) { Data.headp = nodep; Data.endp = nodep; } else Data.endp -> nextp = nodep; Data.endp = nodep; nodep -> Node_Data = (Map_Type)push_data; ++Data.List_Size; return this; } Stack_l<Map_Type>& pop(void) { if (Data.headp) { if (Data.List_Size == 1u) { delete Data.headp; Data.List_Size = 0; Data.headp = 0; Data.endp = 0; } else { Data.endp = Data.endp -> lastp; delete Data.endp -> nextp; Data.endp -> nextp = 0; --Data.List_Size; } } return this; } Stack_l<Map_Type>& clear(void) { while (Data.List_Size) { pop(); } return this; } Stack_l<Map_Type>(void) { /* NULL / } Stack_l<Map_Type>(unsigned int data_size, Map_Type map_data) { Data.List_Size = data_size; while (data_size--) { Node nodep = new Node(); nodep -> Node_Data = map_data; if (Data.headp) { nodep -> lastp = Data.endp; Data.endp -> nextp = nodep; Data.endp = nodep; } else { Data.headp = nodep; Data.endp = nodep; } } } Stack_l<Map_Type>(Stack_l<Map_Type>& map_data) { if (!map_data.empty()) { List_Data listp = (List_Data)map_data.data(); Node nodep = listp -> headp, newp; for (unsigned int i = 0; i != listp -> List_Size; ++i, nodep = nodep -> nextp) { newp = new Node(); newp -> Node_Data = nodep -> Node_Data; if (Data.headp) { newp -> lastp = Data.endp; Data.endp -> nextp = newp; Data.endp = newp; } else { Data.headp = newp; Data.endp = newp; } } Data.List_Size = listp -> List_Size; } } Stack_l<Map_Type>& operator=(Stack_l<Map_Type>& copy_data) { if (copy_data.empty()) return this; List_Data listp = (List_Data)copy_data.data(); Node nodep = listp -> headp, newp; for (unsigned int i = 0; i != listp -> List_Size; ++i, nodep = nodep -> nextp) { newp = new Node(); newp -> Node_Data = nodep -> Node_Data; if (Data.headp) { newp -> lastp = Data.endp; Data.endp -> nextp = newp; Data.endp = newp; } else { Data.headp = newp; Data.endp = newp; } } Data.List_Size = listp -> List_Size; return this; } bool operator==(Stack_l<Map_Type>& cmp_data) { if (cmp_data.size() != Data.List_Size) return false; else if (cmp_data.empty() && (!Data.List_Size)) return true; Node nodep1 = Data.headp, nodep2 = ((List_Data)cmp_data.data()) ->headp; for (unsigned int i = 0; i != Data.List_Size; ++i, nodep1 = nodep1 -> nextp, nodep2 = nodep2 ->nextp) { if (nodep1 -> Node_Data != nodep2 -> Node_Data) return false; } return true; } bool operator!=(Stack_l<Map_Type>& cmp_data) { if (cmp_data.size() == Data.List_Size) return false; else if (cmp_data.empty() && (!Data.List_Size)) return false; Node nodep1 = Data.headp, nodep2 = ((List_Data)cmp_data.data()) ->headp; for (unsigned int i = 0; i != Data.List_Size; ++i, nodep1 = nodep1 -> nextp, nodep2 = nodep2 ->nextp) { if (nodep1 -> Node_Data != nodep2 -> Node_Data) return true; } return true; } ~Stack_l<Map_Type>(void) { clear(); } }; /* Stack _ List / template <typename Map_Type> class Stack_v / Stack _ Vector / { private: struct Node { Map_Type Node_Data; Node nextp, lastp; Node(void) { nextp = 0; lastp = 0; } }; struct List_Data { unsigned int List_Size; Node headp, endp; List_Data(void) { List_Size = 0; headp = 0; endp = 0; } }; struct Vector_Data { Map_Type headp, lastp, endp; void resize(unsigned int data_size) { Map_Type newp = new Map_Type[data_size](); endp = newp + data_size - 1; lastp = newp + (data_size > lastp - headp ? lastp - headp : data_size); if (headp) delete[] headp; headp = newp; } Vector_Data(void) { headp = 0; lastp = 0; endp = 0; } }Data; public: unsigned int size(void) { return Data.lastp - Data.headp; } Map_Type& top(void) { return (Data.lastp - 1); } void* data(void) { return &Data; } bool full(void) { if (!Data.headp) return true; return Data.endp + 1 == Data.lastp; } bool empty(void) { if (!Data.headp) return true; return Data.headp == Data.lastp; } Stack_v<Map_Type>& push(Map_Type push_data) { if (full()) Data.resize((unsigned int)((Data.lastp - Data.headp) * 1.5) + 1); Data.lastp = push_data; ++Data.lastp; return this; } Stack_v<Map_Type>& push(Map_Type& push_data) { if (full()) Data.resize((unsigned int)((Data.lastp - Data.headp) * 1.5) + 1); Data.lastp = push_data; ++Data.lastp; return this; } Stack_v<Map_Type>& push(Map_Type* push_data) { if (full()) Data.resize((unsigned int)((Data.lastp - Data.headp) * 1.5) + 1); Data.lastp = push_data; ++Data.lastp; return this; } Stack_v<Map_Type>& push(const Map_Type push_data) { if (full()) Data.resize((unsigned int)((Data.lastp - Data.headp) * 1.5) + 1); Data.lastp = (Map_Type)push_data; ++Data.lastp; return this; } Stack_v<Map_Type>& pop(void) { if (empty()) { if (Data.lastp - Data.headp > 1) Data.resize((Data.lastp - Data.headp) >> 1); else return this; } else --Data.lastp; return this; } Stack_v<Map_Type>(void) { /* NULL / } Stack_v<Map_Type>(unsigned int data_size, Map_Type map_data) { while (data_size) { push(&map_data); --data_size; } } Stack_v<Map_Type>(Stack_v<Map_Type>& map_data) { Vector_Data datap = (Vector_Data)map_data.data(); for (unsigned int i = 0, k = map_data.size(); i != k; ++i) push(datap -> headp + i); } Stack_v<Map_Type>& operator=(Stack_v<Map_Type>& copy_data) { if (copy_data.empty()) clear(); else { Vector_Data datap = (Vector_Data)copy_data.data(); for (unsigned int i = 0, k = copy_data.size(); i != k; ++i) push(datap -> headp + i); } return this; } bool operator==(Stack_v<Map_Type>& cmp_data) { if (size() != cmp_data.size()) return false; else if (empty() && cmp_data.empty()) return true; Vector_Data datap = (Vector_Data)cmp_data.data(); for (unsigned int i = 0, k = size(); i != k; ++i) { if ((Data.headp + i) != (datap ->headp + i)) return false; } return true; } bool operator!=(Stack_v<Map_Type>& cmp_data) { if (size() != cmp_data.size()) return true; else if (empty() && cmp_data.empty()) return false; Vector_Data datap = (Vector_Data)cmp_data.data(); for (unsigned int i = 0, k = size(); i != k; ++i) { if ((Data.headp + i) != (datap -> headp + i)) return true; } return false; } Stack_v<Map_Type>& clear(void) { delete[] Data.headp; Data.headp = 0; Data.lastp = 0; Data.endp = 0; return this; } ~Stack_v<Map_Type>(void) { delete[] Data.headp; } }; / Stack _ Vector */ int main(void) { return 0; } (22029-xys)	30ms	6.9 MiB		192 Bytes	2023-7-27 9:34:47
AC	dengfeng	31ms	456 KiB		249 Bytes	2022-12-23 14:18:08
AC	司雨来 (siyulai)	32ms	476 KiB		215 Bytes	2023-1-8 20:27:31
AC	RanHao	33ms	6.9 MiB		292 Bytes	2023-8-3 11:55:30
AC	我很6 (zjj22031)	33ms	440 KiB		227 Bytes	2023-4-16 9:37:00
AC	马渝杭 (mayuhang)	37ms	460 KiB		286 Bytes	2023-3-15 19:57:56
AC	新壹街校区-陈琬舒 (空空大师)	40ms	7.1 MiB		600 Bytes	2023-12-23 10:17:27
AC	wangjun	52ms	7 MiB		271 Bytes	2023-12-21 16:59:59
AC	zyl	86ms	556 KiB		244 Bytes	2024-2-2 12:56:20
AC	cj66	93ms	576 KiB	C++11(O2)	232 Bytes	2024-9-19 21:22:00
AC	张瑞博	96ms	576 KiB	C++11	232 Bytes	2024-9-4 13:19:21
AC	LittleHair	101ms	580 KiB		266 Bytes	2024-3-16 20:06:19
AC	姚宏逸	150ms	328 KiB		532 Bytes	2022-6-2 22:58:25
AC	梨冻亿 (wiueh)	230ms	4.4 MiB	Python 3	128 Bytes	2022-1-23 19:53:05
AC	Tender. (05c05-zhou)	332ms	472 KiB		289 Bytes	2022-10-19 22:06:23
AC	zhm123	336ms	464 KiB		361 Bytes	2023-5-8 19:23:32
AC	李哲 (lizhe)	338ms	452 KiB		422 Bytes	2022-9-27 22:02:19
AC	肖添宇	342ms	452 KiB		427 Bytes	2022-5-14 19:43:43
AC	Guest	420ms	7.3 MiB	C++98	412 Bytes	2024-4-27 16:30:58
AC	爱情海校区—沙天一 (沙天一)	461ms	7.1 MiB		346 Bytes	2023-7-9 9:28:50
AC	美术猫映画 (mkh)	503ms	6.9 MiB		402 Bytes	2023-8-12 14:26:45
AC	1396013295	513ms	316 KiB		533 Bytes	2022-1-28 19:31:14
AC	miku (阳沐珊)	535ms	6.7 MiB		312 Bytes	2023-9-10 14:49:41
AC	汪致卉 (wangzh)	540ms	460 KiB		386 Bytes	2022-1-23 20:50:25
AC	新壹街校区--税崇峻 (税崇峻)	543ms	6.8 MiB		275 Bytes	2023-10-8 22:22:04
AC	huanglu	545ms	6.8 MiB	C++98	425 Bytes	2024-5-23 13:20:41
AC	樊竣熠 (lft1114)	569ms	532 KiB		386 Bytes	2022-2-27 18:15:42
AC	王晨志 (wangchenzhi)	589ms	460 KiB		364 Bytes	2022-7-1 15:53:57
AC	阮 (媚狐不吃道旁李)	592ms	7.3 MiB	C++98	288 Bytes	2024-5-4 11:45:12
AC	zhangyh (张育菡)	623ms	444 KiB		396 Bytes	2022-6-26 21:00:53
AC	05c05-scl	631ms	444 KiB		337 Bytes	2022-10-6 18:11:16
AC	何星震 (Jacob)	649ms	488 KiB		331 Bytes	2023-2-23 18:30:38
AC	罗翊宸	676ms	764 KiB		300 Bytes	2024-2-29 19:25:13
AC	05c05-zzx	720ms	452 KiB		331 Bytes	2022-10-2 18:39:41
AC	杨坤霖 (steven)	760ms	704 KiB		480 Bytes	2023-3-2 19:47:09
AC	tongxiao	792ms	764 KiB		361 Bytes	2024-2-29 17:50:18
AC	朱老师 (zyp)	795ms	768 KiB		454 Bytes	2024-1-31 16:47:28
AC	zhy123	797ms	572 KiB		321 Bytes	2024-1-31 16:48:41
AC	王子航	801ms	564 KiB		307 Bytes	2024-2-29 19:33:51
AC	霍弈丞小号	805ms	468 KiB		342 Bytes	2023-4-16 17:15:52
AC	拥抱幸福小熊(吴沛篪)	815ms	7 MiB	C++98	320 Bytes	2024-6-1 9:05:09