ProgramNote/MergeSort.cpp at main · Evan-6/ProgramNote · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
#include <iostream>
#include<cstdio>
#include <vector>
using namespace std;
void merge(vector<int> &b,int l,int mid,int r){
	if(l>=r)return;
	vector<int> LArray,RArray;
	for(int i=l;i<=mid;i++){
		LArray.push_back(b[i]);
	}
	for(int i=mid+1;i<=r;i++){
		RArray.push_back(b[i]);
	}
	int ltmp=0,rtmp=0;
	for(int i=l;i<=r;i++){
		if(ltmp==LArray.size()){
			b[i]=RArray.at(rtmp++);
		}
		else if(rtmp==RArray.size()){
			b[i]=LArray.at(ltmp++);
		}
		else if(LArray[ltmp]<RArray[rtmp]){
			b[i]=LArray.at(ltmp++);
		}
		else{
			b[i]=RArray.at(rtmp++);
		}
	}
}
void ms(vector<int> &b,int l,int r){
	if(l<r){
		int mid=l+r;
		mid/=2;
//		for(int i=l;i<=mid;i++){
//			cout<<b[i]<<" ";
//			if(i==mid)cout<<endl;
//		}
//
//		for(int i=mid+1;i<=r;i++){
//			cout<<b[i]<<" ";
//			if(i==r)cout<<endl;
//		}
		ms(b,l,mid);
		ms(b,mid+1,r);
		merge(b,l,mid,r);
	}
}
int main(){
	int a;
	cin>>a;
	while(a--){
		vector<int> b;

		int c;
		cin>>c;
		while(c!=-1){
			b.push_back(c);
			cin>>c;
		}
		ms(b,0,b.size()-1);
//		for(int i=0;i<b.size();i++){
//			cout<<b[i]<<" ";
//		}
		int d=b.size();
		if(d%2==0){
			printf("Median = %.2f\n",float(b[d/2-1]+b[d/2])/2);
		}else{
			printf("Median = %d\n",b[d/2]);
	}
	}
}