pku1007、poj1007DNA Sorting

题目链接：

http://acm.pku.edu.cn/JudgeOnline/problem?id=1007

http://poj.grids.cn/problem/1007/

 

代码一：用string类和vector。

 

#include <iostream> #include <vector> #include <string>#include <algorithm> using namespace std; vector<string> v1; bool cmp(string s1,string s2) { int sum1=0,sum2=0; for(int i=0;i<s1.length();i++) for(int j=i+1;j<s1.length();j++) if(s1[i]>s1[j]) sum1++; for(int i=0;i<s2.length();i++) for(int j=i+1;j<s2.length();j++) if(s2[i]>s2[j]) sum2++; return sum1<sum2; } int main() { int N,r,c,cnt=1; string s; while(scanf("%d %d",&c,&r)!=EOF ) { v1.clear(); for(int i=0;i<r;i++) { cin>>s; v1.push_back(s); } sort(v1.begin(),v1.end(),cmp); if(cnt!=1) cout<<endl; for(int i=0;i<v1.size();i++) { cout<<v1[i]<<endl; } cnt++; } return 0; }

 

代码二：仅用string类。

 

//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#include <iostream> #include <string>#include <algorithm> using namespace std; bool cmp(string s1,string s2) { int sum1=0,sum2=0; int i,j; for( i=0;i<s1.length();i++) for( j=i+1;j<s1.length();j++) if(s1[i]>s1[j]) sum1++; for(i=0;i<s2.length();i++) for(j=i+1;j<s2.length();j++) if(s2[i]>s2[j]) sum2++; return sum1<sum2; } string s[105];int main() { int N,i,r,c,cnt=1; while(cin>>c>>r) { for( i=0;i<r;i++) cin>>s[i]; sort(s,s+r,cmp); if(cnt!=1) cout<<endl; for(i=0;i<r;i++) { cout<<s[i]<<endl; } cnt++; } return 0; }