diff --git a/calc.js b/calc.js
index dd61a6c..dee668f 100644
--- a/calc.js
+++ b/calc.js
@@ -155,6 +155,21 @@ function Solve(arr, num) {
 
   dfs(0);
 
+  // Sort res by the number of distinct elements in each matrix, in descending order
+  // If the number of distinct elements is the same, sort by the highest number in l for each element used in A and B
+  res.sort((A, B) => {
+    let distinctA = new Set(A.flat()).size;
+    let distinctB = new Set(B.flat()).size;
+
+    if (distinctA !== distinctB) {
+      return distinctB - distinctA;
+    } else {
+      let maxA = Math.max(...A.flat().map(x => l[x-1]));
+      let maxB = Math.max(...B.flat().map(x => l[x-1]));
+      return maxB - maxA;
+    }
+  });
+
   return res;
 }
 
diff --git a/calc.min.js b/calc.min.js
index c355405..5b02045 100644
--- a/calc.min.js
+++ b/calc.min.js
@@ -1 +1 @@
-"use strict";function Solve(r,e){res=[],m=r.length,n=r[0].length,a=new Array(m);for(var o=0;o<m;++o)a[o]=r[o].map(function(r){return r});return l=e.map(function(r){return r}),dfs(0),res}function canPlaceBlock(r,e,o,l){for(var t=blocks[o][l],f=0;!t[0][f];)++f;if((e-=f)<0)return!1;for(var c=0;c<t.length;++c)for(var i=0;i<t[0].length;++i)if(t[c][i]&&(r+c>=m||e+i>=n||-1!==a[r+c][e+i]))return!1;return!0}function placeBlock(r,n,e,o,l){for(var t=blocks[e][o],f=0;!t[0][f];)++f;n-=f;for(var c=0;c<t.length;++c)for(var i=0;i<t[0].length;++i)t[c][i]&&(a[r+c][n+i]=l)}function dfs(r){if(r===m*n){for(var e=new Array(m),o=0;o<m;++o)e[o]=a[o].map(function(r){return r});return res.push(e),res.length>=1e4&&(alert("方案数太多，仅计算前一万种。减少一些方块吧~"),!0)}var t=Math.floor(r/n),f=r%n;if(-1!==a[t][f])return!!dfs(r+1);for(var c=0;c<blocks.length;++c)if(l[c])for(var i=0;i<blocks[c].length;++i)if(canPlaceBlock(t,f,c,i)){if(placeBlock(t,f,c,i,c+1),--l[c],dfs(r+1))return!0;++l[c],placeBlock(t,f,c,i,-1)}return!1}var blocks=[[[[1,1],[1,1]]],[[[2,2,2,2]],[[2],[2],[2],[2]]],[[[3,3,0],[0,3,3]],[[0,3],[3,3],[3,0]]],[[[0,4,4],[4,4,0]],[[4,0],[4,4],[0,4]]],[[[5,0,0],[5,5,5]],[[5,5],[5,0],[5,0]],[[5,5,5],[0,0,5]],[[0,5],[0,5],[5,5]]],[[[0,0,6],[6,6,6]],[[6,6],[0,6],[0,6]],[[6,6,6],[6,0,0]],[[6,0],[6,0],[6,6]]],[[[0,7,0],[7,7,7]],[[7,7,7],[0,7,0]],[[7,0],[7,7],[7,0]],[[0,7],[7,7],[0,7]]],[[[0,8,0],[8,8,8],[0,8,0]]],[[[9]]],[[[10,10]],[[10],[10]]],[[[11,11],[11,0]],[[11,11],[0,11]],[[0,11],[11,11]],[[11,0],[11,11]]]],m=void 0,n=void 0,a=void 0,l=void 0,res=void 0;
\ No newline at end of file
+const blocks=[[[[1,1],[1,1]]],[[[2,2,2,2]],[[2],[2],[2],[2]]],[[[3,3,0],[0,3,3]],[[0,3],[3,3],[3,0]]],[[[0,4,4],[4,4,0]],[[4,0],[4,4],[0,4]]],[[[5,0,0],[5,5,5]],[[5,5],[5,0],[5,0]],[[5,5,5],[0,0,5]],[[0,5],[0,5],[5,5]]],[[[0,0,6],[6,6,6]],[[6,6],[0,6],[0,6]],[[6,6,6],[6,0,0]],[[6,0],[6,0],[6,6]]],[[[0,7,0],[7,7,7]],[[7,7,7],[0,7,0]],[[7,0],[7,7],[7,0]],[[0,7],[7,7],[0,7]]],[[[0,8,0],[8,8,8],[0,8,0]]],[[[9]]],[[[10,10]],[[10],[10]]],[[[11,11],[11,0]],[[11,11],[0,11]],[[0,11],[11,11]],[[11,0],[11,11]]]];let m,n,a,l,res;function Solve(e,t){res=[],m=e.length,n=e[0].length,a=new Array(m);for(let t=0;t<m;++t)a[t]=e[t].map((e=>e));return l=t.map((e=>e)),dfs(0),res.sort(((e,t)=>{let n=new Set(e.flat()).size,r=new Set(t.flat()).size;if(n!==r)return r-n;{let n=Math.max(...e.flat().map((e=>l[e-1])));return Math.max(...t.flat().map((e=>l[e-1])))-n}})),res}function canPlaceBlock(e,t,l,r){const o=blocks[l][r];let f=0;for(;!o[0][f];)++f;if((t-=f)<0)return!1;for(let l=0;l<o.length;++l)for(let r=0;r<o[0].length;++r)if(o[l][r]&&(e+l>=m||t+r>=n||-1!==a[e+l][t+r]))return!1;return!0}function placeBlock(e,t,l,n,r){const o=blocks[l][n];let f=0;for(;!o[0][f];)++f;t-=f;for(let l=0;l<o.length;++l)for(let n=0;n<o[0].length;++n)o[l][n]&&(a[e+l][t+n]=r)}function dfs(e){if(e===m*n){const e=new Array(m);for(let t=0;t<m;++t)e[t]=a[t].map((e=>e));return res.push(e),res.length>=1e4&&(alert("方案数太多，仅计算前一万种。减少一些方块吧~"),!0)}const t=Math.floor(e/n),r=e%n;if(-1!==a[t][r])return!!dfs(e+1);for(let n=0;n<blocks.length;++n)if(l[n])for(let o=0;o<blocks[n].length;++o)if(canPlaceBlock(t,r,n,o)){if(placeBlock(t,r,n,o,n+1),--l[n],dfs(e+1))return!0;++l[n],placeBlock(t,r,n,o,-1)}return!1}
\ No newline at end of file