5 条题解

  • 1
    @ 2025-9-8 13:38:01

    学了vector,这些题就是简单!

    #include<bits/stdc++.h>
    #define int long long
    using namespace std;
    const int N=1e5;
    signed main(){
    	int n,b;
    	cin>>n;
    	vector<int>j(n);
    	for(int i=0;i<n;i++){
    		cin>>j[i];
    	}
    	cin>>b;
    	j.insert(j.begin()+1,b);//vector插入
    	stable_sort(j.begin(),j.end());
    	for(int i=0;i<=n;i++){
    		cout<<j[i]<<" ";
    	}
    }
    • 0
      @ 2023-9-10 13:53:08
      #include <bits/stdc++.h>
      using namespace std;
      const int N=1e7+10;
      const int INF=0x3f3f3f3f;
      int a[N],f;
      int main()
      {
      	int n,m;
      	cin>>n;
      	for(int i=1;i<=n;i++)
      	{
      		cin>>a[i];
      	}
      	cin>>m;
      	a[n+1]=m;
      	sort(a+1,a+n+2);
      	for(int i=1;i<=n+1;i++)
      	{
      		cout<<a[i]<<" ";
      	}
      	return 0;
      }
      

      最简单题解

      • -1
        @ 2023-9-10 13:49:42

        插入排序:我懂

        #include <bits/stdc++.h>
        using namespace std;
        const int N=1e7+10;
        const int INF=0x3f3f3f3f;
        int a[N],f;
        int main()
        {
        	int n,m;
        	cin>>n;
        	for(int i=1;i<=n;i++)
        	{
        		cin>>a[i];
        	}
        	cin>>m;
        	for(int i=1;i<=n;i++)
        	{
        		if((m<=a[i] && f==0))
        		{
        			cout<<m<<" ";
        			f=1;
        		}
        		cout<<a[i]<<" ";
        	} 
        	if(f==0)
        	{
        		cout<<m;
        	}
        	return 0;
        }
        
        
        • -1
          @ 2023-5-29 17:47:48
          #include <iostream>
          #include <stack>
          #include <cmath>
          #include <vector>
          #include <string.h>
          #include <queue>
          #include <stdio.h>
          #include <iomanip>
          #include <cstdio>
          #include <algorithm>
          #define int long long
          using namespace std;
          const int N = 1e5 + 10;
          const int INF = 0x3f3f3f3f;
          int a[N];
          signed main()
          {
              int n;
              cin >> n;
              for(int i = 1; i <= n; i++)
              {
                  cin >> a[i];
              }
              a[n + 1] = INF;
              a[0] = -INF;
              int x;
              bool flag = 0;
              cin >> x;
              for(int i = 1; i <= n; i++)
              {
                  if(x > a[i - 1] && x <= a[i])
                  {
                      cout << x << " ";
                      flag = 1;
                  }
                  cout << a[i] << " ";
              }
              if(flag == 0)
              {
                  cout << x << endl;
              }
          	return 0;
          }
          
          • -1
            @ 2023-2-2 14:39:57

            以一己之力将难度8变成了难度7

            #include <iostream>
            #include <stack>
            #include <cmath>
            #include <vector>
            #include <string.h>
            #include <queue>
            #include <stdio.h>
            #include <iomanip>
            #include <cstdio>
            #include <algorithm>
            #define int long long
            using namespace std;
            const int N = 1e5 + 10;
            const int INF = 0x3f3f3f3f;
            int a[N];
            signed main()
            {
                int n;
                cin >> n;
                for(int i = 1; i <= n; i++)
                {
                    cin >> a[i];
                }
                a[n + 1] = INF;
                a[0] = -INF;
                int x;
                bool flag = 0;
                cin >> x;
                for(int i = 1; i <= n; i++)
                {
                    if(x > a[i - 1] && x <= a[i])
                    {
                        cout << x << " ";
                        flag = 1;
                    }
                    cout << a[i] << " ";
                }
                if(flag == 0)
                {
                    cout << x << endl;
                }
            	return 0;
            }
            
            • 1

            信息

            ID
            1025
            时间
            1000ms
            内存
            128MiB
            难度
            6
            标签
            递交数
            438
            已通过
            141
            上传者