The language of all strings with more $1$s than $0$s is a context free language, recognized by a PDA P that keeps a $($positive or negative$)$ unary count on its stack of numbers of $1$s plus the number of $0$s that have been seen so far on the input.