It is implementation-defined. I would say there is at least four bytes for the length, but there could also be "next" and "previous" pointers to adjacent blocks. There could also be a "magic" number that the runtime uses to make sure you haven't accidentally overwritten their section of the memory and so on.
But you shouldn't ever need to worry about that. In fact, for a small array like your int[10] (which is 40 bytes) you might find that the largest amount of space is actually taking up by padding (for example, there could be 24 bytes of padding added to make the allocation a multiple of 32 - which could be done for performance reasons, say.
At the end of the day, though, as I said it's completely up to the implementation to decide how they do it.