In fact, I'm intrested in such a question:
If $\sigma$ and $\pi$ are two permutations of $\{1,2,\ldots,n\}$ what is necessary and sufficient condition to be the following statement true. For all $a_1\geqslant a_2\geqslant \ldots \geqslant a_n$ and $b_1\geqslant b_2\geqslant \ldots \geqslant b_n$ $$ a_1b_{\sigma(1)}+a_2b_{\sigma(2)}+\ldots+a_nb_{\sigma(n)}\geqslant a_1b_{\pi(1)}+a_2b_{\pi(2)}+\ldots+a_nb_{\pi(n)} $$
Consider graph $G$ with elements of $S_n$ as a vertices and connect $\sigma$ and $\pi$ from $\sigma$ to $\pi$ when $\sigma(i)=\pi(i)$ for all $i\in \{1,2,\ldots,n\}\setminus \{k,l\}$, $\sigma(k)=\pi(l)$, $\sigma(l)=\pi(k)$ and $\sigma(k)>\sigma(l)$.
Then for all $a_1\geqslant a_2\geqslant \ldots \geqslant a_n$ and $b_1\geqslant b_2\geqslant \ldots \geqslant b_n$ we have $$ a_kb_{\sigma(k)}+a_lb_{\sigma(l)}-a_kb_{\pi(k)}-a_l{\pi(l)}= (a_k-a_l)(b_{\sigma(k)}-b_{\sigma(l)})\geqslant 0 $$
In fact, if we can go from $\sigma$ to $\pi$ in $G$ then we can with certainty state that the inequality holds.
On the other hand, let's consider $\sigma$, $\pi\in S_3$: $\sigma(1)=1$, $\sigma(2)=3$, $\sigma(3)=2$ and $\sigma(1)=2$, $\sigma(2)=1$, $\sigma(3)=3$. Then $$ 1\cdot 1+0\cdot 0+0\cdot 0\geqslant 1\cdot 0+0\cdot 1+0\cdot 0 $$ and $$ 0\cdot 0+0\cdot (-1)+(-1)\cdot 0\leqslant 0\cdot 0+0\cdot 0+(-1)\cdot (-1) $$
So, I have no idea what to do in most general case.