Codeforces Round #601 (Div. 2) B Fridge Lockers

//题目要求的是每一个点最少要有两条边连接，所以可以先构成一个环。然后再把剩余的最短的边连接起来
#include<iostream>
#include<algorithm>
using namespace std ;
const int N=;
int n,m;
struct edge {
    int num;
    int w;
} a[N];
int T;
bool cmp(edge a,edge b) {
    return a.w<b.w;
}
void solve() {
    int ans=;
    for(int i=; i<=n; i++) {
        ans+=*a[i].w;
    }
    ans+=(m-n)*(a[].w+a[].w);
    cout<<ans<<endl;
    for(int i=; i<n; i++) cout<<i<<" "<<i+<<endl;
    cout<<n<<" "<<""<<endl;
    for(int i=; i<=m-n; i++) cout<<a[].num<<" "<<a[].num<<endl;
}
int main() {
    cin>>T;
    while(T--) {
        cin>>n>>m;
        for(int i=; i<=n; i++) {
            cin>>a[i].w;
            a[i].num=i;
        }
        if(n<=||m<n) {
            cout<<"-1"<<endl;
            continue;
        }
        sort(a+,a++n,cmp);
        solve();
    }
    return ;
}