Erdős problem 361

Let $c > 0$ and $n$ be some large integer. What is the size of the largest set $A \subseteq \{1, \ldots, \lfloor c n \rfloor\}$ such that $n$ is not a sum of a subset of $A$? Does this depend on $n$ in an irregular way?