Codeforces1313B.Different Rules 构造1700

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn=1e5+5;
#define IO ios::sync_with_stdio(false);cin.tie(0);
ll n,t,x,y;

int main(){
	cin>>t;
	while(t--){
		cin>>n>>x>>y;
		ll bad=min(n,x+y-1);//n=4 2 4  //15 24 33 42 51 尽量多的人同名 //11 24 33 42
		ll good=0;
		if(x+y<=n)
			good=1;	//n=4 2 2  //22 14 41 33
		else{
			good=min(x+y-n+1,n);
		}
		cout<<good<<" "<<bad<<endl;
	}
	return 0; 
}

来源：CSDN

作者：阿晴0219

链接：https://blog.csdn.net/qq_40423146/article/details/104587714