{"trustable":true,"prependHtml":"\u003cstyle type\u003d\"text/css\"\u003e\n section pre {\n display: block;\n padding: 9.5px;\n margin: 0 0 10px;\n font-size: 13px;\n line-height: 1.42857143;\n word-break: break-all;\n word-wrap: break-word;\n color: #333;\n background: rgba(255, 255, 255, 0.5);\n border: 1px solid #ccc;\n border-radius: 6px;\n }\n\u003c/style\u003e\n\u003cscript\u003e\n window.katexOptions \u003d {\n delimiters: [\n {left: \u0027\\\\(\u0027, right: \u0027\\\\)\u0027, display: false},\n {left: \u0027\\\\[\u0027, right: \u0027\\\\]\u0027, display: true}\n ]\n };\n\u003c/script\u003e\n","sections":[{"title":"Bài toán","value":{"format":"HTML","content":"\u003csection\u003e\n\u003cp\u003eBạn có \u003cvar\u003e\\(N\\)\u003c/var\u003e lá bài. Trên lá bài thứ \u003cvar\u003e\\(i\\)\u003c/var\u003e, có một số nguyên \u003cvar\u003e\\(A_i\\)\u003c/var\u003e được viết.\u003c/p\u003e\n\u003cp\u003eĐối với mỗi \u003cvar\u003e\\(j \u003d 1, 2, ..., M\\)\u003c/var\u003e theo thứ tự này, bạn sẽ thực hiện thao tác sau một lần:\u003c/p\u003e\n\u003cp\u003eThao tác: Chọn tối đa \u003cvar\u003e\\(B_j\\)\u003c/var\u003e lá bài (có thể là không). Thay số nguyên viết trên mỗi lá bài được chọn bằng \u003cvar\u003e\\(C_j\\)\u003c/var\u003e.\u003c/p\u003e\n\u003cp\u003eTìm tổng lớn nhất có thể của các số nguyên viết trên \u003cvar\u003e\\(N\\)\u003c/var\u003e lá bài sau \u003cvar\u003e\\(M\\)\u003c/var\u003e thao tác.\u003c/p\u003e\n\u003c/section\u003e"}},{"title":"Điều kiện","value":{"format":"HTML","content":"\u003csection\u003e\n\u003cul\u003e\n\u003cli\u003eTất cả các giá trị đầu vào đều là số nguyên.\u003c/li\u003e\n\u003cli\u003e\u003cvar\u003e\\(1 \\leq N \\leq 10^5\\)\u003c/var\u003e\u003c/li\u003e\n\u003cli\u003e\u003cvar\u003e\\(1 \\leq M \\leq 10^5\\)\u003c/var\u003e\u003c/li\u003e\n\u003cli\u003e\u003cvar\u003e\\(1 \\leq A_i, C_i \\leq 10^9\\)\u003c/var\u003e\u003c/li\u003e\n\u003cli\u003e\u003cvar\u003e\\(1 \\leq B_i \\leq N\\)\u003c/var\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/section\u003e"}},{"title":"Nhập","value":{"format":"HTML","content":"\u003csection\u003e\n\u003cp\u003eDữ liệu nhập theo định dạng sau từ đầu vào tiêu chuẩn:\u003c/p\u003e\n\u003cpre\u003e\u003cvar\u003e\\(N\\)\u003c/var\u003e \u003cvar\u003e\\(M\\)\u003c/var\u003e\r\n\u003cvar\u003e\\(A_1\\)\u003c/var\u003e \u003cvar\u003e\\(A_2\\)\u003c/var\u003e \u003cvar\u003e\\(...\\)\u003c/var\u003e \u003cvar\u003e\\(A_N\\)\u003c/var\u003e\r\n\u003cvar\u003e\\(B_1\\)\u003c/var\u003e \u003cvar\u003e\\(C_1\\)\u003c/var\u003e\r\n\u003cvar\u003e\\(B_2\\)\u003c/var\u003e \u003cvar\u003e\\(C_2\\)\u003c/var\u003e\r\n\u003cvar\u003e\\(\\vdots\\)\u003c/var\u003e\r\n\u003cvar\u003e\\(B_M\\)\u003c/var\u003e \u003cvar\u003e\\(C_M\\)\u003c/var\u003e\r\n\u003c/pre\u003e\n\u003c/section\u003e"}},{"title":"Đầu ra","value":{"format":"HTML","content":"\u003csection\u003e\n\u003cp\u003eIn ra tổng lớn nhất có thể của các số nguyên viết trên \u003cvar\u003e\\(N\\)\u003c/var\u003e lá bài sau \u003cvar\u003e\\(M\\)\u003c/var\u003e thao tác.\u003c/p\u003e\n\u003c/section\u003e"}},{"title":"Ví dụ 1","value":{"format":"HTML","content":"\u003ctable class\u003d\u0027vjudge_sample\u0027\u003e\n\u003cthead\u003e\n \u003ctr\u003e\n \u003cth\u003eInput\u003c/th\u003e\n \u003cth\u003eOutput\u003c/th\u003e\n \u003c/tr\u003e\n\u003c/thead\u003e\n\u003ctbody\u003e\n \u003ctr\u003e\n \u003ctd\u003e\u003cpre\u003e3 2\r\n5 1 4\r\n2 3\r\n1 5\r\n\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003e14\r\n\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n\u003csection\u003e\n\u003c/section\u003e\n\u003csection\u003e\n\u003cp\u003eBằng cách thay số nguyên trên lá bài thứ hai bằng \u003cvar\u003e\\(5\\)\u003c/var\u003e, tổng của các số nguyên viết trên ba lá bài trở thành \u003cvar\u003e\\(5 + 5 + 4 \u003d 14\\)\u003c/var\u003e, đây là kết quả lớn nhất.\u003c/p\u003e\n\u003c/section\u003e"}},{"title":"Ví dụ 2","value":{"format":"HTML","content":"\u003ctable class\u003d\u0027vjudge_sample\u0027\u003e\n\u003cthead\u003e\n \u003ctr\u003e\n \u003cth\u003eInput\u003c/th\u003e\n \u003cth\u003eOutput\u003c/th\u003e\n \u003c/tr\u003e\n\u003c/thead\u003e\n\u003ctbody\u003e\n \u003ctr\u003e\n \u003ctd\u003e\u003cpre\u003e10 3\r\n1 8 5 7 100 4 52 33 13 5\r\n3 10\r\n4 30\r\n1 4\r\n\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003e338\r\n\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n\u003csection\u003e\n\u003c/section\u003e\n\u003csection\u003e\n\u003c/section\u003e"}},{"title":"Ví dụ 3","value":{"format":"HTML","content":"\u003ctable class\u003d\u0027vjudge_sample\u0027\u003e\n\u003cthead\u003e\n \u003ctr\u003e\n \u003cth\u003eInput\u003c/th\u003e\n \u003cth\u003eOutput\u003c/th\u003e\n \u003c/tr\u003e\n\u003c/thead\u003e\n\u003ctbody\u003e\n \u003ctr\u003e\n \u003ctd\u003e\u003cpre\u003e3 2\r\n100 100 100\r\n3 99\r\n3 99\r\n\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003e300\r\n\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n\u003csection\u003e\n\u003c/section\u003e\n\u003csection\u003e\n\u003c/section\u003e"}},{"title":"Ví dụ 4","value":{"format":"HTML","content":"\u003ctable class\u003d\u0027vjudge_sample\u0027\u003e\n\u003cthead\u003e\n \u003ctr\u003e\n \u003cth\u003eInput\u003c/th\u003e\n \u003cth\u003eOutput\u003c/th\u003e\n \u003c/tr\u003e\n\u003c/thead\u003e\n\u003ctbody\u003e\n \u003ctr\u003e\n \u003ctd\u003e\u003cpre\u003e11 3\r\n1 1 1 1 1 1 1 1 1 1 1\r\n3 1000000000\r\n4 1000000000\r\n3 1000000000\r\n\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003e10000000001\r\n\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n\u003csection\u003e\n\u003c/section\u003e\n\u003csection\u003e\n\u003cp\u003eKết quả có thể không vừa với kiểu số nguyên \u003cvar\u003e\\(32\\)\u003c/var\u003e bit.\u003c/p\u003e\n\u003c/section\u003e"}}]}