洛谷 P1309 瑞士轮 归并

洛谷 P1309 瑞士轮

https://www.luogu.com.cn/problem/P1309

每一轮快排，超时：

# include<iostream>
# include<fstream>
# include<vector> 
# include<algorithm> 
using namespace std;
class Athlete
{
   
public:
	int id,competence,score;
	Athlete(){
   }
	// 
	Athlete(int _id,int _competence,int _score):id(_id),competence(_competence),score(_score)
	{
   

	}
};

bool comp(const Athlete& _a, const Athlete& _b)
{
   
	if(_a.score>_b.score)
		return true;
	else if(_a.score<_b.score)
		return false;
	else
		return _a.id<_b.id;
}

int main()
{
   
	int N,R,Q;
//	ifstream infile("data.txt");
//	infile>>N>>R>>Q;
	cin>>N>>R>>Q;
	int* init_score_arr=new int[2*N];
	int* competence_arr=new int[2*N];
	vector<Athlete> athlete_vec;
	for(int i=0;i<2*N;++i)
		cin>>init_score_arr[i];
	for(int i=0;i<2*N;++i)
		cin>>competence_arr[i];