Existence of two disjoint long cycles in graphs

Let n,h be integers with n⩾6 and h⩾7. We prove that if G is a graph of order n with σ2(G)⩾h, then G contains two disjoint cycles C1 and C2 such that |V(C1)|+|V(C2)|⩾min{h,n}.