HDU1379 DNA Sorting

原题链接

#include <cstdio>
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
using namespace std;

struct Node{
	string str;
	int val;
};

int cmp(Node a, Node b){
	return a.val < b.val;
}

int main(){
	int n, m, i, val, t;
	vector<Node> vec;	
	string str;
	Node temp;
	scanf("%d", &t);
	while(t--){
		scanf("%d%d", &n, &m);
		for(i = 0; i < m; ++i){
			cin >> str;
			
			val = 0; //求逆序数
			for(int j = 0; j < str.size(); ++j)
				for(int k = j + 1; k < str.size(); ++k)
					if(str[k] < str[j]) ++val;				
			
			temp.val = val;
			temp.str = str;
			vec.push_back(temp);
		}
		
		stable_sort(vec.begin(), vec.end(), cmp);
		
		for(i = 0; i < vec.size(); ++i)
			cout << vec[i].str << endl;
		
		vec.clear();
	}
	return 0;
}

10545883

2014-04-15 11:32:15

Accepted

1379

0MS

396K

793 B

G++

长木