1 #include<iostream>2 #include<vector>3 using namespace std;4 5 int main()6 {7     int i;8     int A[10]={9,5,8,6,4,2,3,7,0,1};9     vector<int> V;
10
11     for(i=0;i<10;i++)
12     {
13         V.push_back(A[i]);
14     }
15
16     vector<int>::iterator it;
17     for(it=V.begin();it!=V.end();it++)
18     {
19         cout<<*it<<endl;
20     }
21
22     return 0;
23 } 

 1 #include<iostream>2 #include<vector>3 #include<algorithm>  4 using namespace std;5 6 int main()7 {8     int i;9     int A[10]={9,5,8,6,4,2,3,7,0,1};
10     vector<int> V;
11
12     for(i=0;i<10;i++)
13     {
14         V.push_back(A[i]);
15     }
16
17     sort(V.begin(),V.end());//排序方法
18
19     vector<int>::iterator it;
20     for(it=V.begin();it!=V.end();it++)
21     {
22         cout<<*it<<" ";
23     }
24
25     return 0;
26 } 

bool Comp(const int &a,const int &b)
{return a>b;
}

 1 #include<vector>  2 #include<cstdio>  3 #include<algorithm>  4 using namespace std;  5   6 struct student  7 {  8     int kaohao;  9     int defen;
10     int caifen;
11     int zongfen;
12 };
13
14 bool compare(student a,student b) //比较a在b前则返回true,表示a在b前面
15 {
16     if(a.zongfen>b.zongfen)
17         return true;
18     else if(a.zongfen == b.zongfen)
19     {
20         if(a.defen>b.defen)
21             return true;
22         else if(a.defen==b.defen)
23         {
24             if(a.kaohao<b.kaohao)
25                 return true;
26         }
27     }
28     return false;
29 }
30
31 int main()
32 {
33     vector<student> v1,v2,v3,v4;//表示四类考生
34     student stu;//学生信息临时保存
35     int count=0;//达标的学生总数
36     int N,L,H;
37
38     //cin>>N>>L>>H;
39     scanf("%d %d %d",&N,&L,&H);
40     int K,D,C;
41     while(N--)
42     {
43         //cin>>K>>D>>C;
44         scanf("%d%d%d",&K,&D,&C);
45         stu.kaohao = K;
46         stu.defen = D;
47         stu.caifen = C;
48         stu.zongfen = D+C;
49         if(D>=L && C>=L)
50         {
51             count++;
52             if(D>=H && C>=H)
53                 v1.push_back(stu);
54             else if(D>=H && C<H )
55                 v2.push_back(stu);
56             else if(D<H && C<H  && D>=C)
57                 v3.push_back(stu);
58             else
59                 v4.push_back(stu);
60         }
61
62     }
63     printf("%d\n",count);
64     sort(v1.begin(),v1.end(),compare);
65     sort(v2.begin(),v2.end(),compare);
66     sort(v3.begin(),v3.end(),compare);
67     sort(v4.begin(),v4.end(),compare);
68
69     vector<student>::iterator itr;
70     for(itr=v1.begin();itr!=v1.end();itr++)
71         printf("%d %d %d\n",itr->kaohao,itr->defen,itr->caifen);
72     for(itr=v2.begin();itr!=v2.end();itr++)
73         printf("%d %d %d\n",itr->kaohao,itr->defen,itr->caifen);
74     for(itr=v3.begin();itr!=v3.end();itr++)
75         printf("%d %d %d\n",itr->kaohao,itr->defen,itr->caifen);
76     for(itr=v4.begin();itr!=v4.end();itr++)
77         printf("%d %d %d\n",itr->kaohao,itr->defen,itr->caifen);
78
79     system("pause");
80     return 0;
81 }