Start with the definitions... if f is right continuous at p, that means that for any e>0, there is a d>0 such that at every point q in the interval (p,p+d), |f(p)-f(q)| < e.
Conversely, if f is not left continuous at a point p, that means that there exists an e>0 such that there is no d>0 such that at every point q in (p-d,p), |f(p)-f(q)| < e. At each point p, pick some e=e(p) that works for the definition of left continuous at that p. (choose e(p) = 0 if p is not in L, for convenience)
Now, here is a method you can count L by: first count {p in L : e(p) > 1}. Then count {p in L : e(p) > 1/2}. Then count {p in L : e(p) > 1/4}. And so forth. L is the union of these sets, and the countable union of countable sets is itself countable, so this gives a way to count L.
To show that this works, you first need to show that for any k>0, {p in L : e(p) > k} is countable. You can do this by first proving a lemma that at each such p, there is some f>0 such that for every point q in the interval (p, p + f), e(q) <= k. (Prove it by contradiction using the definition of right continuous). Now all you have to do is show that the lemma implies {p in L : e(p) > k} is countable, which shouldn't be too hard (just devise some way to count a bunch of isolated points).