poj 1007 DNA Sorting(STL运用)

Description
One measure of ``unsortedness'' in a sequence is the number of pairs of entries that are out of order with respect to each other. For instance, in the letter sequence ``DAABEC'', this measure is 5, since D is greater than four letters to its right and E is greater than one letter to its right. This measure is called the number of inversions in the sequence. The sequence ``AACEDGG'' has only one inversion (E and D)---it is nearly sorted---while the sequence ``ZWQM'' has 6 inversions (it is as unsorted as can be---exactly the reverse of sorted).
You are responsible for cataloguing a sequence of DNA strings (sequences containing only the four letters A, C, G, and T). However, you want to catalog them, not in alphabetical order, but rather in order of ``sortedness'', from ``most sorted'' to ``least sorted''. All the strings are of the same length.
Input
The first line contains two integers: a positive integer n (0 < n <= 50) giving the length of the strings; and a positive integer m (0 < m <= 100) giving the number of strings. These are followed by m lines, each containing a string of length n.
Output
Output the list of input strings, arranged from ``most sorted'' to ``least sorted''. Since two strings can be equally sorted, then output them according to the orginal order.
Sample Input
10 6
AACATGAAGG
TTTTGGCCAA
TTTGGCCAAA
GATCAGATTT
CCCGGGGGGA
ATCGATGCAT
Sample Output
CCCGGGGGGA
AACATGAAGG
GATCAGATTT
ATCGATGCAT
TTTTGGCCAA

TTTGGCCAAA

 

进行排序，不是按照字典序进行排序，而是根据，逆序对的多少进行排序，逆序对多的放在后面

就是简单的sort+pair+string

 

AC代码：

 

 

# include <iostream>
# include <algorithm>
# include <string>
# include <vector>
using namespace std;
typedef pair<string, int> pp;
pp v[110];
string s[110];
int m, n;
int compare(pp a, pp b){
	return a.second<b.second;
}
int main(){
	int i, j, k;
	int num1, num2;
	int value;
	while(cin>>m>>n){
		for(i=0; i<n; i++){
			cin>>s[i];
		}
		for(i=0; i<n; i++){
			value=0;
			for(j=0; j<=m-2; j++){
				for(k=j+1; k<=m-1; k++){
					if(s[i][j]>s[i][k]){
						value++;
					}
				}
			}
			v[i]=make_pair(s[i], value);
		}
		sort(v, v+n, compare);
		for(i=0; i<n; i++){
			cout<<v[i].first<<'\n';
		}
	}
	return 0;
}