CT30864

Gail's Faded Ledger

MediumL4 · Loop LordAcceptance: 0.0%XP: 35

The council of the spice bazaar of Saffronia pays by the answer, and Gail intends to earn it. First: the full register of registers. Task: The array is sorted non-decreasing. Print the 1-based position where x would be inserted to keep the order (before equal values). Input format: First line: n and x. Second line: n sorted integers. Output format: Print the insertion position (1..n+1). Constraints: 1 <= n <= 5285; 0 <= a[i],x <= 1000.

Example 1:

Input: 705 621 0 1 3 8 9 11 13 14 15 16 16 17 18 19 20 23 25 25 29 29 30 31 31 31 39 39 40 42 44 44 44 46 46 46 50 50 51 53 53 54 59 60 62 65 67 68 68 68 69 70 71 73 74 78 79 80 83 83 84 85 86 87 87 94 94 96 99 99 100 104 104 105 106 108 109 109 110 110 113 113 113 114 116 117 120 123 126 127 127 127 128 134 136 139 140 143 146 149 153 154 155 157 157 157 158 162 164 164 166 170 171 175 179 179 180 180 181 183 187 187 190 190 192 192 194 199 200 201 201 202 205 205 205 209 209 213 213 213 214 216 217 217 218 219 227 229 232 232 234 235 235 236 237 238 239 243 243 244 245 245 245 247 247 248 249 250 252 252 253 258 260 261 262 263 263 263 264 265 267 268 274 275 275 276 277 279 285 290 293 293 294 295 297 299 299 300 301 303 303 304 307 308 310 312 312 314 314 314 315 318 318 322 322 323 326 329 3…
Output: 422

Example 2:

Input: 2157 373 0 0 2 2 2 3 3 3 4 4 4 5 5 5 6 6 6 7 7 9 10 10 11 12 13 13 13 13 14 15 15 15 16 16 16 16 16 17 18 18 19 19 19 20 20 20 21 21 22 22 22 22 23 23 23 23 24 25 25 28 28 29 29 31 31 31 31 31 32 32 32 33 33 33 34 36 37 38 38 38 38 38 38 39 39 39 42 43 43 45 45 46 46 46 47 47 48 49 50 51 51 52 52 52 53 53 53 54 54 54 55 55 55 55 56 57 57 58 59 60 60 60 61 61 62 62 64 64 65 66 66 66 67 67 67 67 69 70 71 71 71 71 72 73 73 73 73 74 74 74 75 75 75 77 77 78 78 79 79 80 80 81 81 82 82 82 83 83 83 84 84 84 85 85 86 86 87 88 88 88 89 90 91 91 91 93 93 94 95 96 96 96 97 97 99 99 100 100 100 101 101 101 102 102 102 102 104 104 104 105 106 106 106 108 108 109 109 110 110 111 111 111 112 113 113 113 114 114 114 115 115 116 118 118 118 118 119 119 119 119 119 119 120 120 121 121 122 123 124 124 124 124…
Output: 784

Example 3:

Input: 2291 466 1 2 2 2 3 4 4 6 6 7 7 8 8 9 10 10 11 11 12 12 12 12 13 13 13 14 14 14 15 15 15 16 16 17 17 17 18 19 19 20 20 20 20 20 21 21 23 23 23 23 24 24 24 24 24 25 26 26 26 26 27 28 28 28 29 29 31 32 32 34 34 34 34 34 36 36 36 37 37 37 38 39 40 40 40 41 41 44 44 44 44 45 45 47 47 47 48 49 49 50 50 51 51 51 53 54 54 54 54 55 55 57 57 58 59 59 59 59 59 60 61 61 62 62 62 63 63 64 64 64 65 65 65 65 65 66 67 67 67 67 67 67 69 70 70 70 70 71 71 71 71 72 72 73 73 74 74 75 75 76 76 77 78 79 79 80 80 80 80 81 81 81 82 82 82 82 83 83 83 83 83 84 84 84 85 85 86 86 87 87 87 88 88 89 89 89 90 90 91 92 92 92 93 93 93 94 94 95 95 95 96 96 96 96 98 98 98 98 98 98 98 99 100 100 100 100 101 102 103 103 103 104 104 104 106 106 106 108 108 109 110 110 111 111 111 112 113 113 113 113 113 114 115 115 116 116 117…
Output: 1120

Constraints:

1 <= n <= 5285; 0 <= a[i],x <= 1000.

Loading...
Test Cases:No test cases
No test cases available.