In the usual Achlioptas processes the smallest clusters of a few randomly chosen ones are selected to merge together at each step. The resulting aggregation process leads to the delayed birth of a giant cluster and the so-called explosive percolation transition showing a set of anomalous features. We explore a process with the opposite selection rule, in which the biggest clusters of the randomly chosen ones merge together. We develop a theory of this kind of percolation based on the Smoluchowski equation, find the percolation threshold, and describe the scaling properties of this continuous transition, namely, the critical exponents and amplitudes, and scaling functions. We show that, qualitatively, this transition is similar to the ordinary percolation one, though occurring in less connected systems.PACS numbers: 64.60.ah, 05.40.-a, 64.60.FAggregation processes based on progressive merging together the smallest clusters of a few randomly chosen (Achlioptas rule) have attracted much attention in the last years [1][2][3][4][5][6][7][8][9][10][11][12][13][14][15][16]. These specific processes and models show a number of unusual features [17] distinguishing them sharply from ordinary aggregation processes and standard percolation, in which random clusters merge together with probability proportional to their sizes [18][19][20]. Apart from the delayed percolation phase transition, which is continuous, as we found for a wide range of systems [4,9] and which was proven mathematically [12,13], these models demonstrate a uniquely small exponent β of the percolation cluster and unusual scaling functions. The smallness of β makes the transition so "sharp" that it is difficult to distinguish it from discontinuous in simulations, which resulted in the term "explosive percolation" [1]. A few real-world applications of these processes were identified [21][22][23]. The Achlioptas processes, generalizing percolation, constitute a wide class including the processes generated by the original "product rule" (two clusters with the smallest product of sizes are selected) [1], the sum rule (clusters with the smallest sum of sizes are selected), the rule selecting the smallest clusters [4], and many others, of which only a small number were explored. The problem is how far from the standard percolation scenario can these diverse rules and their variations lead? How easy can one deviate from the typical percolation behavior by exploiting the "power of choice" [24] in these processes? Notably, in these rules another kind of optimization can be considered, namely, selecting not the smallest but the largest clusters. In particular, the question is: what will happen if we invert the Achlioptas rule, that is, at each step merge together the two largest clusters of a few randomly selected ones [25,26]?In the present article we answer to this question by considering a representative set of processes based on the inverse Achlioptas rule, for which we derive the Smoluchowski equation. By solving these equations numerically and analytically we ...