Place one pointer at the start and one at the end. The sorted property lets you decide which pointer to move.
Compute sum = nums[left] + nums[right].
If sum == target, return the indices.
If sum < target, you need a larger sum. Move left right.
If sum > target, you need a smaller sum. Move right left.
This works because moving the wrong pointer can only make things worse.