工信部企业网站认证,wordpress数据库连接错误,专业的网站设计制作公司,举报网站建设情况贪心优先队列的题#xff0c;贪心会漏一个情况#xff0c;不知道怎么处理#xff0c;这里直接打表了 2 1 1 48 49 答案是30#xff0c;贪心是31 专有名词#xff1a;hack-有新的测试点过不了
#includebits/stdc.h
using namespace std;
#define endl \n
#define … 贪心优先队列的题贪心会漏一个情况不知道怎么处理这里直接打表了 2 1 1 48 49 答案是30贪心是31 专有名词hack-有新的测试点过不了
#includebits/stdc.h
using namespace std;
#define endl \n
#define int long long
#define pp ios::sync_with_stdio(0),cin.tie(0),cout.tie(0)
const int MAX INT_MAX;int n,P,Q;
priority_queueintq;int do_P(int x){return floor(sqrt(x));
}
int do_Q(int x){return floor(x/2);
}int choose(int x){int aMAX,bMAX;if(P0)a do_P(x);if(Q0)b do_Q(x);if(ab){P--;return a;}else{Q--;return b;}
}
int da_biao(int x,int y){int aMAX,bMAX;a do_P(x);b do_Q(y);int ans ab;int a2MAX,b2MAX;a2 do_Q(x);b2 do_P(y);int ans2 a2b2;return ans2ans?ans:ans2;
}void solve(){cinnPQ;for(int i1;in;i){int a;cina;q.push(a);}if(q.size()2P1Q1){int x q.top();q.pop();int y q.top();q.pop();coutda_biao(x,y)endl;exit(0);}int count QP;for(int i1;icount;i){int temp q.top();q.pop();int ans choose(temp);q.push(ans);}int len q.size();int ans0;for(int i0;ilen;i){ansq.top();q.pop();}coutansendl;return;
}signed main(){pp;int T1;while(T--)solve();return 0;
}
