rms D WA求条
  • 板块灌水区
  • 楼主qw1234321
  • 当前回复4
  • 已保存回复4
  • 发布时间2024/5/17 21:59
  • 上次更新2024/5/18 09:27:51
查看原帖
rms D WA求条
1060759
qw1234321楼主2024/5/17 21:59
#include<bits/stdc++.h>
#define int long long
#define il inline
namespace things{
	il int rd(){
		int f = 1, x = 0;
		char ch = getchar();
		while(ch < '0' || ch > '9'){
			if (ch == '-') f = -1;
			ch = getchar();
		}
		while(ch >= '0' && ch <= '9'){
			x = x * 10 + ch - '0';
			ch = getchar();
		}
		return x * f;
	}
	il int max(int x, int y){
		return std::max(x, y);
	}
	il int min(int a, int b){
		return std::min(a, b);
	}
}
using namespace things;
using namespace std;

const int N = 2e5 + 5;
int n, m, k, x, y, z, p, q, r;
int a[N], b[N], c[N];
bool f;
string s, u, v;
stack<int> st;
vector<int> g;

void work(){
	p = q = 0;
	cin >> n;
	for (int i = 1; i <= n; i++) cin >> a[i];
	for (int i = 1; i <= n; i++) cin >> b[i];
	for (int i = 1; i <= n; i++){
		if (a[i] > b[i]) p++;
		if (a[i] < b[i]) q++;
	}
	cout << p << " " << q << "\n";
	if (p < q) cout << "Q\n";
	if (p > q) cout << "S\n";
	if (p == q) cout << "Tie\n";
}

signed main(){
	int t = 1;
	//	cin >> t;
	while(t--) work();
	return 0;
}
2024/5/17 21:59
加载中...