4461266_ac_16ms_320k.cpp

部分PKU上的源码

#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
using namespace std;
struct pa
{
	int num;
	string k;
};
int number(string a)
{
	int result=0;
	for(int count=0;count<a.length();count++)
	{
		for(int count2=count+1;count2<a.length();count2++)
		{
			if(a[count]>a[count2]) result++;
		}
	}
	return result;
}
bool less(pa a,pa b)
{
	return a.num<b.num;
}
int main()
{
	vector<pa> result;
	int n,m;
	cin>>n>>m;
	string input[100];

	for(int count=0;count<m;count++) 
	{
		cin>>input[count];
		int temp=number(input[count]);
		pa new_pa;
		new_pa.num=temp;new_pa.k=input[count];
		result.push_back(new_pa);
	}
	stable_sort(result.begin(),result.end(),less);
	cout<<result[0].k;
	for(int count2=1;count2<m;count2++)
	{
		cout<<endl;
		cout<<result[count2].k;
	}
	return 1;
}