洛谷选举学生会

不用sort冒泡做法

#include <iostream>
using namespace std;
int main ()
{
  int m;cin>>m;
	int n; cin >> n;
	int* in = new int[n];
	for (int i = 0; i < n; i++)
		cin >> in[i];
	for (int j = 0; j < n - 1; j++)
	{
		for (int i = 0; i < n - 1; i++)
		{
			if (in[i] > in[i + 1])
			{
				int tmp = in[i];
				in[i] = in[i + 1];
				in[i + 1] = tmp;
			}
		}
	}
	for (int i = 0; i < n; i++)
	{
		cout << in[i] << " ";
	}
	cout << endl;
}