2021暑假集训-个人赛8

---

A.Mean Inequality

传送门
题目大意：给你一列数，让你进行排列，要满足，两边的和的平均数不等于中间那个数
思路：首先进行sort排序，因为是偶数个，将排序后的分为前后两部分，后面部分逆序，跟前部分交替输出就好

#include<iostream>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<queue>
#include<stack>
#include <limits>
#include<string>
#include<deque>
#include<map>
#include<bitset>
#include<set>
#include<cstdio>
#include<vector>
#define ll long long
#define PI 3.141592653589793
#define E 2.718281828459045
#define HalF (l + r)>>1
#define lsn rt<<1
#define rsn rt<<1|1
#define Lson lsn, l, mid
#define Rson rsn, mid+1, r
#define QL Lson, ql, qr
#define QR Rson, ql, qr
#define myself rt, l, r
#define mem(a,b) memset(a,b,sizeof(a))
#define REPF( i , a , b ) for ( int i = a ; i <= b ; ++ i )
#define REP( i , n ) for ( int i = 0 ; i < n ; ++ i )
#define lowbit(a) ((a)&-(a))
typedef unsigned long long ull;
const ll INF=0x3f3f3f3f;
const ll Max=100;
using namespace std;
int t,n,m;
ll a[Max];
ll b[Max],c[Max];
/*queue<ll> q;
stack<ll> s;
//升序队列
priority_queue <int,vector<int>,greater<int> > q;
//降序队列
priority_queue <int,vector<int>,less<int> >q;*/
int main()
{
    scanf("%d",&t);
    while(t--)
    {   mem(a,0);
       mem(b,0);
       mem(c,0);
        scanf("%d",&n);
        for(int i=0;i<2*n;i++)
            scanf("%lld",&a[i]);
        sort(a,a+2*n);

         int j=0;
            for(int i=0;i<n;i++)
                b[i]=a[i];
            for(int i=2*n-1;i>=n;i--)
                c[j++]=a[i];
            for(int i=0;i<n;i++)
                printf("%lld %lld ",b[i],c[i]);
                cout<<endl;
    }

    return 0;
}

B.I Hate 1111

传送门
题目大意：要求判断某个数能否由若干11,111,1111…组成，可以就输出YES，否者就输出NO
思路：可以组成的数都可以写成a11+b111(a，b可以为0)，所以需要对11和111进行取余判断；由题意分析，对11取余后的余数中的每一个1，都由111提供，111可以拆为11乘10+1，所以对11取余后的余数，原来的数减去111*余数后的数，只有能被11整除才满足条件，详细看代码

#include<iostream>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<queue>
#include<stack>
#include <limits>
#include<string>
#include<deque>
#include<map>
#include<bitset>
#include<set>
#include<cstdio>
#include<vector>
#define ll long long
#define PI 3.141592653589793
#define E 2.718281828459045
#define HalF (l + r)>>1
#define lsn rt<<1
#define rsn rt<<1|1
#define Lson lsn, l, mid
#define Rson rsn, mid+1, r
#define QL Lson, ql, qr
#define QR Rson, ql, qr
#define myself rt, l, r
#define mem(a,b) memset(a,b,sizeof(a))
#define REPF( i , a , b ) for ( int i = a ; i <= b ; ++ i )
#define REP( i , n ) for ( int i = 0 ; i < n ; ++ i )
#define lowbit(a) ((a)&-(a))
typedef unsigned long long ull;
const ll INF=0x3f3f3f3f;
const ll Max=100;
using namespace std;
int t,n,m;
/*queue<ll> q;
stack<ll> s;
//升序队列
priority_queue <int,vector<int>,greater<int> > q;
//降序队列
priority_queue <int,vector<int>,less<int> >q;*/
int main()
{
    scanf("%d",&t);
    while(t--)
    {
        ll x;
        scanf("%lld",&x);
        ll y=x%11;ll w=x;
        if(w>111)
          w=x-y*111;
        if(x%11==0||(w>0&&w%11==0)||x%111==0)
            printf("YES\n");
        else printf("NO\n");
    }


    return 0;
}

C.Potions (Easy Version)

传送门
题目大意：给你一串数，有正有负，类似于毒药和解药，解药会加血，毒药扣血，一开始你的初始血量为0，你只能从左到右遍历，可以选择喝或者不喝，在你血量非负的情况下，输出能喝到的最多的瓶数
思路：一开始遇到就喝，计数器加一，如果遇到毒药喝完，就压入优先队列（升序），然后当你血量小于0时，就吐出队头的毒药，让毒药出队
我是用的降序，压入的是相反数，我忘了升序怎么写了

#include<iostream>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<queue>
#include<stack>
#include <limits>
#include<string>
#include<deque>
#include<map>
#include<bitset>
#include<set>
#include<cstdio>
#include<vector>
#define ll long long
#define PI 3.141592653589793
#define E 2.718281828459045
#define HalF (l + r)>>1
#define lsn rt<<1
#define rsn rt<<1|1
#define Lson lsn, l, mid
#define Rson rsn, mid+1, r
#define QL Lson, ql, qr
#define QR Rson, ql, qr
#define myself rt, l, r
#define mem(a,b) memset(a,b,sizeof(a))
#define REPF( i , a , b ) for ( int i = a ; i <= b ; ++ i )
#define REP( i , n ) for ( int i = 0 ; i < n ; ++ i )
#define lowbit(a) ((a)&-(a))
typedef unsigned long long ull;
const ll INF=0x3f3f3f3f;
const ll Max=2010;
using namespace std;
int t,n,m;
/*queue<ll> q;
stack<ll> s;
//升序队列
priority_queue <int,vector<int>,greater<int> > q;
//降序队列
priority_queue <int,vector<int>,less<int> >q;*/
int main()
{
	priority_queue<int>q;
	scanf("%lld",&n);
	ll sum=0,a,j;
	int k=0;
	for(int i=0; i<n; i++)
	{
		scanf("%lld",&a);
		sum+=a;k++;
		if(a<0)
			q.push(-a);
		if(sum<0)
		{	j=q.top();
			sum+=j;
			q.pop();
			k--;
		}
	}
	printf("%d\n",k);
	return 0;
}

D.Potions (Hard Version)

传送门
跟C题差不多，就是扩大了一下数据量，应该是为了卡dp
反正我就试了一下，就对了

#include<iostream>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<queue>
#include<stack>
#include <limits>
#include<string>
#include<deque>
#include<map>
#include<bitset>
#include<set>
#include<cstdio>
#include<vector>
#define ll long long
#define PI 3.141592653589793
#define E 2.718281828459045
#define HalF (l + r)>>1
#define lsn rt<<1
#define rsn rt<<1|1
#define Lson lsn, l, mid
#define Rson rsn, mid+1, r
#define QL Lson, ql, qr
#define QR Rson, ql, qr
#define myself rt, l, r
#define mem(a,b) memset(a,b,sizeof(a))
#define REPF( i , a , b ) for ( int i = a ; i <= b ; ++ i )
#define REP( i , n ) for ( int i = 0 ; i < n ; ++ i )
#define lowbit(a) ((a)&-(a))
typedef unsigned long long ull;
const ll INF=0x3f3f3f3f;
const ll Max=2010;
using namespace std;
int t,n,m;
/*queue<ll> q;
stack<ll> s;
//升序队列
priority_queue <int,vector<int>,greater<int> > q;
//降序队列
priority_queue <int,vector<int>,less<int> >q;*/
int main()
{
	priority_queue<int>q;
	scanf("%lld",&n);
	ll sum=0,a,j;
	int k=0;
	for(int i=0; i<n; i++)
	{
		scanf("%lld",&a);
		sum+=a;k++;
		if(a<0)
			q.push(-a);
		if(sum<0)
		{	j=q.top();
			sum+=j;
			q.pop();
			k--;
		}
	}
	printf("%d\n",k);
	return 0;
}

E.Oolimry and Suffix Array *

传送门

F.Median Queries *

传送门