_kite's blog

Help in 309C
By _kite, history, 3 years ago, In English

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.

  • Vote: I like it
  • 0
  • Vote: I do not like it

Comments Comments (2)
| Write comment?
»
4 months ago, # |
  Vote: I like it 0 Vote: I do not like it

You missed something. You can put more than 1 element from array b in a single memory cluster. You need another approach.

→ Reply
»
4 months ago, # |
  Vote: I like it 0 Vote: I do not like it

Hey can anyone tell me why my $$$N * log(N)$$$ solution TLE. 236895058

→ Reply