7 条题解

  • 2
    @ 2023-4-13 13:29:18
    • 1
      @ 2024-1-12 15:09:31
      #include<iostream>
      #include<algorithm>
      using namespace std;
      struct info{
      	int jubin;
      	double time;
      	double neicun;
      	int id;
      	char name[31];
      };
      bool cmp(info a,info b){
      	return a.time>b.time;
      }
      int main(){
      	info inf[100];
      	int n;
      	cin>>n;
      	for(int i=0;i<n;i++){
      		cin>>inf[i].jubin;
      		cin>>inf[i].time;
      		cin>>inf[i].neicun;
      		cin>>inf[i].id;
      		cin>>inf[i].name;
      	}
      	sort(inf,inf+n,cmp);
      	for(int i=0;i<n;i++){
      		printf("%8d ",inf[i].jubin);
      		printf("%10.2f ",inf[i].time);
      		printf("%10.2f ",inf[i].neicun);
      		printf("%8d ",inf[i].id);
      		printf("%s\n",inf[i].name);
      	}
      	return 0;
      }
      
      • 1
        @ 2023-5-28 10:02:04

        image

        • 0
          @ 2024-1-12 15:18:10
          #include<iostream>
          #include<algorithm> 
          using namespace std;
          struct info{
          	int jubin;
          	double time;
          	double neicun;
          	int id;
          	char name[31];
          };
          bool cmp(info a,info b){
          	return a.time>b.time;
          }
          int main(){
          	info inf[100];
          	int n;
          	cin>>n;
          	for(int i=0;i<n;i++){
          		cin>>inf[i].jubin;
          		cin>>inf[i].time;
          		cin>>inf[i].neicun;
          		cin>>inf[i].id;
          		cin>>inf[i].name;
          	}
          	sort(inf,inf+n,cmp);
          	for(int i=0;i<n;i++){
          		printf("%8d",inf[i].jubin);
          		printf("%10.2f",inf[i].time);
          		printf("%10.2f",inf[i].neicun);
          		printf("%8d",inf[i].id);		
          		printf("%s\n",inf[i].name);
              }
          	return 0;
          }
          
          • 0
            @ 2024-1-12 15:17:01

            ``

            #include<bits/stdc++.h>
            using namespace std;
            struct info{
            	int jubin;
            	double time;
            	double neicun;
            	int id;
            	char name[31];	
            };
            bool cmp(info a,info b){
            	return a.time >b.time ;
            }
            int main(){
            	info inf[100];
            	int n;
            	cin>>n;
            	for(int i=0;i<n;i++){
            		cin>>inf[i].jubin;
            		cin>>inf[i].time;
            		cin>>inf[i].neicun;
            		cin>>inf[i].id;
            		cin>>inf[i].name;
            	}
            	sort(inf,inf+n,cmp);
            	for(int i=0;i<n;i++){
            		printf("%8d ",inf[i].jubin);
            		printf("%10.2f ",inf[i].time);
            		printf("%10.2f ",inf[i].neicun);
            		printf("%8d ",inf[i].id);
            		printf("%s\n",inf[i].name);
            	}
            	return 0;
            }
            
            ```
            
            ```
            
            ```
            
            ```
            
            ```
            
            ```
            
            ```
            
            ```
            
            ```
            
            ```
            
            ```
            
            ```
            
            
            
            ```
            
            ```
            • 0
              @ 2024-1-12 15:15:00
              #include<iostream>
              #include<algorithm>
              #include<iomanip>
              #include<math.h>
              using namespace std;
              struct info{
              	int jubin;
              	double time;
              	double neicun;
              	int id;
              	char name[31];	
              };
              bool cmp(info a,info b){
              	return a.time >b.time ;
              }
              int main(){
              	info inf[100];
              	int n;
              	cin>>n;
              	for(int i=0;i<n;i++){
              		cin>>inf[i].jubin;
              		cin>>inf[i].time;
              		cin>>inf[i].neicun;
              		cin>>inf[i].id;
              		cin>>inf[i].name;
              	}
              	sort(inf,inf+n,cmp);
              	for(int i=0;i<n;i++){
              		printf("%8d ",inf[i].jubin);
              		printf("%10.2f ",inf[i].time);
              		printf("%10.2f ",inf[i].neicun);
              		printf("%8d ",inf[i].id);
              		printf("%s\n",inf[i].name);
              	}
              	return 0;
              }
              
              • -1
                @ 2024-1-12 15:09:44
                #include<bits/stdc++.h>
                using namespace std;
                struct info{
                	int jubin;
                	double time;
                	double neicun;
                	int id;
                	char name[31];	
                };
                bool cmp(info a,info b){
                	return a.time >b.time ;
                }
                int main(){
                	info inf[100];
                	int n;
                	cin>>n;
                	for(int i=0;i<n;i++){
                		cin>>inf[i].jubin;
                		cin>>inf[i].time;
                		cin>>inf[i].neicun;
                		cin>>inf[i].id;
                		cin>>inf[i].name;
                	}
                	sort(inf,inf+n,cmp);
                	for(int i=0;i<n;i++){
                		printf("%8d ",inf[i].jubin);
                		printf("%10.2f ",inf[i].time);
                		printf("%10.2f ",inf[i].neicun);
                		printf("%8d ",inf[i].id);
                		printf("%s\n",inf[i].name);
                	}
                	return 0;
                }
                
                • 1

                信息

                ID
                578
                时间
                1000ms
                内存
                256MiB
                难度
                7
                标签
                递交数
                47
                已通过
                13
                上传者