diff --git a/examples/cpp/costas_array_sat.cc b/examples/cpp/costas_array_sat.cc
index 79c6bc75fd..c6a68671af 100644
--- a/examples/cpp/costas_array_sat.cc
+++ b/examples/cpp/costas_array_sat.cc
@@ -98,6 +98,7 @@ void CostasHard(const int dim) {
   // create the variables
   std::vector<IntVar> vars;
   Domain domain(1, dim);
+  vars.reserve(dim);
   for (int i = 0; i < dim; ++i) {
     vars.push_back(
         cp_model.NewIntVar(domain).WithName(absl::StrCat("var_", i)));
diff --git a/examples/cpp/frequency_assignment_problem.cc b/examples/cpp/frequency_assignment_problem.cc
index a78e20a4c3..17d25d3c94 100644
--- a/examples/cpp/frequency_assignment_problem.cc
+++ b/examples/cpp/frequency_assignment_problem.cc
@@ -567,6 +567,7 @@ void HardFapSolver(const absl::btree_map<int, FapVariable>& data_variables,
                            static_cast<int>(variables.size()), &cardinality);
     solver.AddConstraint(solver.MakeDistribute(variables, values, cardinality));
     std::vector<IntVar*> value_not_assigned;
+    value_not_assigned.reserve(values.size());
     for (int val = 0; val < values.size(); ++val) {
       value_not_assigned.push_back(
           solver.MakeIsEqualCstVar(cardinality[val], 0));
diff --git a/examples/cpp/jobshop_sat.cc b/examples/cpp/jobshop_sat.cc
index c8cbc78295..2415bb4767 100644
--- a/examples/cpp/jobshop_sat.cc
+++ b/examples/cpp/jobshop_sat.cc
@@ -279,6 +279,7 @@ void CreateAlternativeTasks(
 
         // Exactly one alternative interval is present.
         std::vector<BoolVar> interval_presences;
+        interval_presences.reserve(alternatives.size());
         for (const AlternativeTaskData& alternative : alternatives) {
           interval_presences.push_back(alternative.presence);
         }
diff --git a/examples/cpp/network_routing_sat.cc b/examples/cpp/network_routing_sat.cc
index 0072f8d4b5..5740835abd 100644
--- a/examples/cpp/network_routing_sat.cc
+++ b/examples/cpp/network_routing_sat.cc
@@ -377,9 +377,11 @@ class NetworkRoutingSolver {
     CpModelBuilder cp_model;
     std::vector<IntVar> arc_vars;
     std::vector<IntVar> node_vars;
+    node_vars.reserve(max_length);
     for (int i = 0; i < max_length; ++i) {
       node_vars.push_back(cp_model.NewIntVar(Domain(0, num_nodes() - 1)));
     }
+    arc_vars.reserve(max_length - 1);
     for (int i = 0; i < max_length - 1; ++i) {
       arc_vars.push_back(cp_model.NewIntVar(Domain(-1, count_arcs() - 1)));
     }
diff --git a/examples/cpp/qap_sat.cc b/examples/cpp/qap_sat.cc
index d98ce396a0..af457c5446 100644
--- a/examples/cpp/qap_sat.cc
+++ b/examples/cpp/qap_sat.cc
@@ -60,6 +60,7 @@ void SolveQap() {
   // Occupy each location exactly once.
   for (int l = 0; l < n; ++l) {
     std::vector<BoolVar> tmp;
+    tmp.reserve(n);
     for (int f = 0; f < n; ++f) {
       tmp.push_back(place_vars[f][l]);
     }
diff --git a/examples/cpp/slitherlink_sat.cc b/examples/cpp/slitherlink_sat.cc
index a0a9e7358a..84255e86ea 100644
--- a/examples/cpp/slitherlink_sat.cc
+++ b/examples/cpp/slitherlink_sat.cc
@@ -95,10 +95,12 @@ void SlitherLink(absl::Span<const std::vector<int>> data) {
   CpModelBuilder builder;
 
   std::vector<BoolVar> horizontal_arcs;
+  horizontal_arcs.reserve(2 * num_horizontal_arcs);
   for (int arc = 0; arc < 2 * num_horizontal_arcs; ++arc) {
     horizontal_arcs.push_back(builder.NewBoolVar());
   }
   std::vector<BoolVar> vertical_arcs;
+  vertical_arcs.reserve(2 * num_vertical_arcs);
   for (int arc = 0; arc < 2 * num_vertical_arcs; ++arc) {
     vertical_arcs.push_back(builder.NewBoolVar());
   }
diff --git a/examples/cpp/sports_scheduling_sat.cc b/examples/cpp/sports_scheduling_sat.cc
index ffc7c09251..0b7bdbf68c 100644
--- a/examples/cpp/sports_scheduling_sat.cc
+++ b/examples/cpp/sports_scheduling_sat.cc
@@ -246,6 +246,7 @@ void FixtureModel(int num_teams) {
     for (int other = 0; other < num_teams; ++other) {
       if (team == other) continue;
       std::vector<BoolVar> possible_days;
+      possible_days.reserve(num_days);
       for (int d = 0; d < num_days; ++d) {
         possible_days.push_back(fixtures[d][team][other]);
       }