栈、贪心 CR744D. Productive Meeting

 题目链接

题意：有n个人，每个人能与其他人交谈a[i]次，求最大交谈次数的方案

解法：先对a数组进行sort，然后按从大到小的顺序存入栈b和c，哪个栈的交谈总数小，就存哪个栈，然后对交谈总数大的栈进行判断，如果它的交谈总数比另一个至少大2，且至少有两个人，则这个栈内部先交谈，最后两个栈互相交谈即可

#include<bits/stdc++.h>
#define fo(i,a,b) for(int i=a;i<=b;i++)
using namespace std;
typedef long long ll;
pair<int, int>a[200005];
int main() {
	ios::sync_with_stdio(false);
  cin.tie(0);
  int t, n,k;
  cin >> t;
  while (t--) {
	  cin >> n;
	  for (int i = 0; i < n; i++) {
		  cin >> k; a[i] = { k,i + 1 };
	 }
	  sort(a, a + n);
	  stack< pair<int, int>>b, c;
	  int bb = 0, cc = 0,bn=0,cn=0;
	  for (int i = n - 1; i >= 0; i--) {
		  if (a[i].first == 0)break;
		  if (bb > cc) { c.push(a[i]); cc += a[i].first; cn++; }
		  else { b.push(a[i]); bb += a[i].first; bn++; }
	  }
	  if (cn > 1 && cc - bb > 1) {
		  cout << (bb + cc) / 2 << endl;
		  int cb = (cc - bb) / 2;
		  pair<int, int>c1, c2;
		  c1 = c.top(); c.pop();
		  c2 = c.top(); c.pop();
		  for (int i = 0; i < cb; i++) {
			  cout << c1.second << ' ' << c2.second << endl;
		  }
		  c1.first -= cb; c2.first -= cb;
		  c.push(c2); c.push(c1);
	  }
	  else if (bn > 1 && bb - cc > 1) {
		  cout << (bb + cc) / 2 << endl;
		  int cb = (bb - cc) / 2;
		  pair<int, int>c1, c2;
		  c1 = b.top(); b.pop();
		  c2 = b.top(); b.pop(); c1.first -= cb; c2.first -= cb;
		  for (int i = 0; i < cb; i++) {
			  cout << c1.second << ' ' << c2.second << endl;
		  }
		  b.push(c2); b.push(c1);
	  }
	  else cout << min(bb, cc) << endl;
	  while (b.size() && c.size()) {
		  pair<int, int>bbb, ccc;
		  bbb = b.top();
		  ccc = c.top();
		  b.pop(); c.pop();
		  bb -= bbb.first, cc -= ccc.first;
		  while (bbb.first && ccc.first) {
			  cout << bbb.second << ' ' << ccc.second << endl;
			  bbb.first--, ccc.first--;
		  }
		  if (bbb.first) { b.push(bbb);
		  }
		  if (ccc.first) {c.push(ccc);
		  }
	  }
  }
	return 0;
}