Help in 309C

Revision en2, by _kite, 2020-11-14 13:23:54

Problem Link . My Solution . WA in test case 11 .

I sorted array a increasingly ans b decreasingly . Then for every element in array b , I searched the lower bound in array a .
My code is pretty simple to understand.

Tags #help

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en2 English _kite 2020-11-14 13:23:54 25 Tiny change: '98352733) ,\nI sorted' -> '98352733) . WA in test case 11 .\n\nI sorted'
en1 English _kite 2020-11-14 13:22:54 322 Initial revision (published)