Subtask#0 全WA了
查看原帖
Subtask#0 全WA了
591561
Xianzi_楼主2024/8/26 14:27

我的Subtask#1 是AC了的,但是我调了很久Subtask#0 还是全WA了

#include "bits/stdc++.h"
using namespace std;
vector <int> v, id;
int q;
bool flag;
int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	cin >> q;
	for (int i = 1; i <= q; i++){
		int op, x;
		cin >> op >> x;
		if (op == 1){
			int j;
			id = v;
			id.push_back(x);
			sort(id.begin(), id.end());
			for(j = 0; j < id.size(); j++){
				if (x == id[j]){
					cout << j + 1 << endl;
					break;
				}
			}	
		}
		if (op == 2){
			id = v;
			sort(id.begin(), id.end());
			cout << id[x - 1] << endl;
		}
		if (op == 3){
			int j;
			id = v;
			for (int k = 0; k < id.size(); k++) if (x == id[k]) flag = 1;
			if (!flag) id.push_back(x);
			flag = 0;
			sort(id.begin(), id.end());
			for (j = 0; j < id.size(); j++){
				if (x == id[j] && j != 0){
					flag = 1;
					cout << id[j - 1] << endl;
					break;
				}
			}
			if (!flag) cout << -2147483647 << endl;
		}
		if (op == 4){
			int j;
			id = v;
			for (int k = 0; k < id.size(); k++) if (x == id[k]) flag = 1;
			if (!flag) id.push_back(x);
			flag = 0;
			sort(id.begin(), id.end());
			for (j = 0; j < id.size() + 1; j++){
				if (x == id[j] && j != id.size()){
					flag = 1;
					cout << id[j + 1] << endl;
					break;
				}
			}
			if (!flag) cout << 2147483647 << endl;
		}
		if (op == 5) v.push_back(x);
	}
	return 0;
}

各位大佬帮我看一下吧

2024/8/26 14:27
加载中...