来自我的奇葩写法 能过就行嘿嘿诶嘿

#include<iostream>
#include<algorithm>
#include<cstring>

using namespace std;
const int N = 100010;
int a[N];
int f[N];

int main()
{
    int n;
    cin >> n;

    int x, idx = 0;
    while(scanf("%d", &x) == 1)
    {
        a[x] ++;
        idx ++;
    }

    for(int i = 0; i < N; i ++)
        if(a[i] == 0 && a[i - 1] >= 1 && a[i + 1] >= 1)
            cout << i << ' ';

    for(int i = 0; i < N; i ++)
        if(a[i] > 1)
            cout << i << endl;;

    return 0;
}

#include<iostream>
#include<algorithm>
#include<cstring>

using namespace std;
const int N = 100010;
int a[N];
int f[N];

int main()
{
    int n;
    cin >> n;

    int x, idx = 0;
    while(scanf("%d", &x) == 1)
    {
        a[x] ++;
        idx ++;
    }

    for(int i = 0; i < N; i ++)
        if(a[i] == 0 && a[i - 1] >= 1 && a[i + 1] >= 1)
            cout << i << ' ';

    for(int i = 0; i < N; i ++)
        if(a[i] > 1)
            cout << i << endl;;

    return 0;
}

#include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>

using namespace std;

int cheak(int i)
{
    while(i)
    {
        int x = i % 10;
        i /= 10;
        if(x == 2 || x == 9 || x == 0 || x == 1)
            return 1;
    }

    return 0;
}


int main()
{
    int n;
    cin >> n;
    long long res = 0;

    for(int i = 1; i <= n; i ++)
        if(cheak(i))
            res += i;

    cout << res << endl;

    return 0;
}

#include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>

using namespace std;

int cheak(int i)
{
    while(i)
    {
        int x = i % 10;
        i /= 10;
        if(x == 2 || x == 9 || x == 0 || x == 1)
            return 1;
    }

    return 0;
}


int main()
{
    int n;
    cin >> n;
    long long res = 0;

    for(int i = 1; i <= n; i ++)
        if(cheak(i))
            res += i;

    cout << res << endl;

    return 0;
}

#include<iostream>
#include<cstring>
#include<algorithm>
#include<cstdio>

using namespace std;
const int N = 100010;
int a[N], b[N], c[N];
int n;

int main()
{
    long long sum = 0;
    cin >> n;
    for(int i = 0; i < n; i ++) cin >> a[i];
    for(int i = 0; i < n; i ++) cin >> b[i];
    for(int i = 0; i < n; i ++) cin >> c[i];

    sort(a, a + n);
    sort(b, b + n);
    sort(c, c + n);

    for(int i = 0; i < n; i ++)
    {
        long long x = ( lower_bound(a, a + n, b[i]) - a);
        long long y = n - (upper_bound(c, c + n, b[i]) - c);
        sum += x * y;
    }

    cout << sum << endl;
    return 0;
}

很妙啊

#include<iostream>
#include<cstring>

using namespace std;
const int N = 10010;
int a[N];
int n;


int main()
{
    cin >> n;
    for(int i = 0; i < n; i ++) cin >> a[i];

    int res = 0;
    for(int i = 0; i < n; i ++)
    {
        int maxx = -0x3f3f3f3f, minx = 0x3f3f3f3f;
        for(int j = i; j < n; j ++)
        {
            maxx = max(a[j], maxx);
            minx = min(a[j], minx);
            if(maxx - minx == j - i) res ++;

        }

    }


    cout << res << endl;
    return 0;
}

#include<iostream>
#include<algorithm>
#include<cstring>
#include<cstdio>

using namespace std;
int n;

int main()
{
    cin >> n;
    int max1 = 0, max2 = 0;

    for(int i = 0; i < n; i ++) 
    {
        int x;
        cin >> x;
        max1 += x;
    }


    for(int i = 0; i < n; i ++) 
    {
        int x;
        cin >> x;
        max2 += x;
    }

    if(max1 >= max2) puts("Yes");
    else puts("No");
    return 0;
}

#include<iostream>
#include<algorithm>
#include<cstring>
#include<cstdio>

using namespace std;
int n;

int main()
{
    cin >> n;
    int max1 = 0, max2 = 0;

    for(int i = 0; i < n; i ++) 
    {
        int x;
        cin >> x;
        max1 += x;
    }


    for(int i = 0; i < n; i ++) 
    {
        int x;
        cin >> x;
        max2 += x;
    }

    if(max1 >= max2) puts("Yes");
    else puts("No");
    return 0;
}

#include<iostream>
#include<cstdio>

using namespace std;

const int N = 100010;

int a[N],tem[N],n;

void guibing(int a[],int l, int r)
{
    if(l >= r) return;
    int mid = l + r >> 1;
    guibing(a,l,mid),guibing(a,mid + 1, r);
    int k = 0, i = l,j = mid + 1;
    while(i <= mid && j <= r)
    {
        if(a[i] < a[j]) tem[k++] = a[i ++];
        else tem[k ++] = a[j ++];
    }
    while(i <= mid) tem[k++] = a[i++];
    while(j <= r) tem[k++] = a[j++];

    for(int i = l,k = 0; i <= r;) a[i ++] = tem[k ++];
}

int main()
{
    cin.tie(0);
    cin >> n;

    for(int i = 0; i < n; i ++) cin >> a[i];

    guibing(a,0,n-1);

    for(int i = 0; i < n; i ++) cout << a[i] << ' ';

    return 0;
}

#include<iostream>
#include<algorithm>

using namespace std;
const int N = 1010;
int n, m;
int w[N], v[N];
int f[N];

int main()
{
    cin >> n >> m;

    for(int i = 1; i <= n; i ++) cin >> v[i] >> w[i];

    for(int i = 1; i <= n; i ++)
        for(int j = m; j >= v[i]; j --)
            f[j] = max(f[j], f[j - v[i]] + w[i]);

    cout << f[m] << endl;

    return 0;
}