本文主要是介绍https://codeforces.com/problemset/problem/1579/D，对大家解决编程问题具有一定的参考价值，需要的程序猿们随着小编来一起学习吧！

set中最大值与最小值使用

D. Productive Meeting
https://codeforces.com/problemset/problem/1579/D
time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

An important meeting is to be held and there are exactly nn people invited. At any moment, any two people can step back and talk in private. The same two people can talk several (as many as they want) times per meeting.

Each person has limited sociability. The sociability of the ii-th person is a non-negative integer aiai. This means that after exactly aiai talks this person leaves the meeting (and does not talk to anyone else anymore). If ai=0ai=0, the ii-th person leaves the meeting immediately after it starts.

A meeting is considered most productive if the maximum possible number of talks took place during it.

You are given an array of sociability aa, determine which people should talk to each other so that the total number of talks is as large as possible.

Input

The first line contains an integer tt (1≤t≤10001≤t≤1000) — the number of test cases.

The next 2t2t lines contain descriptions of the test cases.

The first line of each test case description contains an integer nn (2≤n≤2⋅1052≤n≤2⋅105) —the number of people in the meeting. The second line consists of nn space-separated integers a1,a2,…,ana1,a2,…,an (0≤ai≤2⋅1050≤ai≤2⋅105) — the sociability parameters of all people.

It is guaranteed that the sum of nn over all test cases does not exceed 2⋅1052⋅105. It is also guaranteed that the sum of all aiai (over all test cases and all ii) does not exceed 2⋅1052⋅105.

Output

Print tt answers to all test cases.

On the first line of each answer print the number kk — the maximum number of talks possible in a meeting.

On each of the next kk lines print two integers ii and jj (1≤i,j≤n1≤i,j≤n and i≠ji≠j) — the numbers of people who will have another talk.

If there are several possible answers, you may print any of them.

Example

input

Copy

8
2
2 3
3
1 2 3
4
1 2 3 4
3
0 0 2
2
6 2
3
0 0 2
5
8 2 0 1 1
5
0 1 0 0 6

output

Copy

2
1 2
1 2
3
1 3
2 3
2 3
5
1 3
2 4
2 4
3 4
3 4
0
2
1 2
1 2
0
4
1 2
1 5
1 4
1 2
1
5 2

#include<iostream>
#include<algorithm>
#include<vector>
#include<set>
#include<queue>
#define ll long long
#define pu(x) push_back(x)
using namespace std;
const int MAXN = 2e5 + 10;
#define val first
#define id second
int n;
set<pair<int, int> > st;
vector<int> ans;
void cal() {
	pair<int,int> fi = *st.begin();
	st.erase(st.begin());
	if (fi.val == 0)return;
	else {
		while (fi.val) {
			pair<int, int> ed = *(--st.end());
			st.erase(--st.end());
			if (ed.val)ans.pu(fi.id), ans.push_back(ed.id), ed.val--;
			if (ed.val)st.insert(ed);
			fi.val--;
		}
	}
}
void solve()
{
	st.clear(); ans.clear();


	cin >> n;
	for (int i = 1; i <= n; i++) { int x; cin >> x; st.insert({ x,i }); }
	while (st.size()>1)cal();
	cout << (ans.size() / 2) << endl;
	for (int i = 0; i < ans.size(); i += 2) {
		cout << ans[i] << " " << ans[i + 1] << endl;
	}
}
int main()
{
	int t; cin >> t;
	while (t--)solve();
	return 0;
}

这篇关于https://codeforces.com/problemset/problem/1579/D的文章就介绍到这儿，希望我们推荐的文章对大家有所帮助，也希望大家多多支持为之网！