两题居然可以用一个代码交,只能说数据水了。
/************************************
* Author : binwin20 *
* Blog : blog.csdn.net/binwin20 *
************************************/
#pragma comment(linker, "/STACK:1024000000,1024000000")
#include <cstdio>
#include <cmath>
#include <cstring>
#include <iostream>
#include <queue>
#include <map>
#include <stack>
#include <string>
#include <algorithm>
#include <vector>
#include <list>
#include <deque>
#define LL long long
#define DB double
#define SI(a) scanf("%d",&a)
#define SD(a) scanf("%lf",&a)
#define SS(a) scanf("%s",a)
#define PF printf
#define MM(a,b) memset(a,b,sizeof(a))
#define REP(i,a,b) for(int i=a;i<b;i++)
#define REPD(i,a,b) for(int i=a;i>b;i--)
#define INF 0x3f3f3f3f
#define EPS 1e-8
#define bug puts("bug")
using namespace std;
#define N 209
int re[N];
int n,cas;
int main()
{
#ifndef ONLINE_JUDGE
freopen("in.txt","r",stdin);
#endif
SI(cas);
while(cas--) {
SI(n);
REP(i,0,5) SI(re[i]);
sort(re,re+5);
//REP(i,0,5) cout<<re[i]<<endl;
int s = re[0]+re[1]+re[2];
int c = 2*n-re[3]-re[4];
s -= c;
if(s<=0){
PF("0\n");
continue;
}
int ans = 0;
if(re[0]*3>=s){
ans = s/3+((s%3)!=0);
}else {
ans = re[0];
s -= re[0]*3;
re[1] -= re[0];
re[2] -= re[0];
if(re[1]*2>=s){
ans += s/2+((s%2)!=0);
}else {
ans += re[1];
s -= re[1]*2;
ans +=s;
}
}
PF("%d\n",ans);
}
return 0;
}