Suppose that $c\in\left(\frac{1}{2},1\right)$. Find the least $M$ such that for every integer $n\ge 2$ and real numbers $0<a_1\le a_2\le\ldots \le a_n$, if $\frac{1}{n}\sum_{k=1}^{n}ka_{k}=c\sum_{k=1}^{n}a_{k}$, then we always have that $\sum_{k=1}^{n}a_{k}\le M\sum_{k=1}^{m}a_{k}$ where $m=[cn]$
1. **Claim**: The least \( M \) such that for every integer \( n \ge 2 \) and real numbers \( 0 < a_1 \le a_2 \le \ldots \le a_n \), if \(\frac{1}{n}\sum_{k=1}^{n}ka_{k}=c\sum_{k=1}^{n}a_{k}\), then we always have \(\sum_{k=1}^{n}a_{k}\le M\sum_{k=1}^{m}a_{k}\) where \( m = \lfloor cn \rfloor \), is \( M = \frac{1}{1-c} \).

2. **Given**: 
   \[
   \frac{1}{n}\sum_{k=1}^{n}ka_{k}=c\sum_{k=1}^{n}a_{k}
   \]
   This implies:
   \[
   \sum_{k=1}^{n}ka_{k} = cn \sum_{k=1}^{n}a_{k}
   \]

3. **Rewriting the sum**:
   \[
   \sum_{k=1}^{m}(cn-k)a_{k} = \sum_{k=m+1}^{n}(k-cn)a_{k}
   \]
   where \( m = \lfloor cn \rfloor \).

4. **Applying Chebyshev's Inequality**:
   Since \( 0 < a_1 \le a_2 \le \ldots \le a_m \) and \( 0 \le cn - m \le cn - m + 1 \le \ldots \le cn - 1 \), we apply Chebyshev's inequality:
   \[
   \sum_{k=1}^{m}(cn-k)a_{k} \le \frac{1}{m}\sum_{k=1}^{m}(cn-k)\sum_{k=1}^{m}a_{k} \le (cn - \frac{m+1}{2})\sum_{k=1}^{m}a_{k}
   \]

5. **For \( k > m \)**:
   Similarly, since \( 0 < a_{m+1} \le a_{m+2} \le \ldots \le a_n \) and \( 0 < m+1 - cn \le \ldots \le n - cn \), we have:
   \[
   \sum_{k=m+1}^{n}(k-cn)a_{k} \ge \frac{1}{n-m}\sum_{k=m+1}^{n}(k-cn)\sum_{k=m+1}^{n}a_{k} \ge (\frac{m+n+1}{2} - cn)\sum_{k=m+1}^{n}a_{k}
   \]

6. **Combining the inequalities**:
   \[
   (\frac{m+n+1}{2} - cn)\sum_{k=m+1}^{n}a_{k} \le (cn - \frac{m+1}{2})\sum_{k=1}^{m}a_{k}
   \]

7. **Simplifying**:
   \[
   \sum_{k=1}^{n}a_k \le \frac{n}{m+n+1-2cn}\sum_{k=1}^{m}a_k = \frac{1}{1 + \frac{m+1}{n} - 2c}\sum_{k=1}^{m}a_k
   \]
   Since \( m + 1 > cn \), we have:
   \[
   \frac{1}{1 + \frac{m+1}{n} - 2c} < \frac{1}{1 - c}
   \]

8. **Constructing a counterexample**:
   If \( n \ge \frac{1}{2c-1} \), we can take \( a_1 = a_2 = \ldots = a_m = 1 \) and \( a_{m+1} = a_{m+2} = \ldots = a_n = \frac{2cnm - m(m+1)}{(n-m)(n+m+1) - 2cn(n-m)} \). This ensures \( a_{m+1} \ge 1 \) and satisfies:
   \[
   \frac{1}{n}\sum_{k=1}^{n}ka_{k} = c\sum_{k=1}^{n}a_{k}
   \]
   Thus, \( M \ge \frac{1}{1-c} - \frac{1}{n(1-c)^2} \). When \( n \) is sufficiently large, \( M \ge \frac{1}{1-c} \).

9. **Conclusion**:
   Therefore, the least \( M \) is \( \frac{1}{1-c} \).

The final answer is \( \boxed{\frac{1}{1-c}} \).