Linear codes with a few weights have been extensively studied due to their wide applications in secret sharing schemes, strongly regular graphs, association schemes, and authentication codes. In this paper, we choose the defining sets from two distinct weakly regular plateaued balanced functions, based on a generic construction of linear codes. Then we construct a family of linear codes with at most five nonzero weights. Their minimality is also examined and the result shows that our codes are helpful in secret sharing schemes.