Parallel splitting method is an important method for solving the convex optimization problem with two separable variables.The methods usually requires that the two convex functions have relatively easy proximal mappings, for the structure that only one of the two functions has easy proximal mapping and the other one is smoothly convex but does not have an easy proximal mapping.We propose in this paper an extragradient algorithm based on parallel splitting.Under the assumption that the smooth function has a Lipschitz continuous gradient condition, we prove the O(1/ε)iteration complexity of the method.