C. Slay the Dragon

Recently, Petya learned about a new game “Slay the Dragon”. As the name suggests, the player will have to fight with dragons. To defeat a dragon, you have to kill it and defend your castle. To do this, the player has a squad of n heroes, the strength of the i-th hero is equal to ai.

According to the rules of the game, exactly one hero should go kill the dragon, all the others will defend the castle. If the dragon’s defense is equal to x, then you have to send a hero with a strength of at least x to kill it. If the dragon’s attack power is y, then the total strength of the heroes defending the castle should be at least y.
The player can increase the strength of any hero by 1 for one gold coin. This operation can be done any number of times.
There are m dragons in the game, the i-th of them has defense equal to xi and attack power equal to yi. Petya was wondering what is the minimum number of coins he needs to spend to defeat the i-th dragon.
Note that the task is solved independently for each dragon (improvements are not saved).
Input
The first line contains a single integer n (2≤n≤2⋅105) — number of heroes.
The second line contains n integers a1,a2,…,an (1≤ai≤1012), where ai is the strength of the i-th hero.
The third line contains a single integer m (1≤m≤2⋅105) — the number of dragons.
The next m lines contain two integers each, xi and yi (1≤xi≤1012;1≤yi≤1018) — defense and attack power of the i-th dragon.
Output
Print m lines, i-th of which contains a single integer — the minimum number of coins that should be spent to defeat the i-th dragon.

input

output

先二分查找判断能不能找到，若能找到则使用这个值。
找不到就判断比所有制都大还是比所有值都小，还是在这个值的区间范围内。
若是比所有值都大则使用最大值
比所有值都小使用最小值。
若在这两个值范围之内则分别使用查找出的i和i-1求出结果取min

#include<stdio.h>
#include<iostream>
#include<algorithm>
using namespace std;
typedef long long ll;
ll n;
ll a[2000006];
int main()
{cin>>n;ll sum=0;for(ll i=1; i<=n; i++){scanf("%lld",&a[i]);sum+=a[i];}sort(a+1,a+n+1);ll t;cin>>t;ll atk,def;while(t--){scanf("%lld%lld",&atk,&def);ll i=lower_bound(a+1,a+n+1,atk)-a;//找到第一个大于等于他的数ll ans=0;if(a[i]==atk)//找到一个值等于龙的攻击值{if(sum-a[i]>=def)printf("0\n");elseprintf("%lld\n",def-sum+a[i]);}else if(i<n){ll ans1=0;ll ans2=0;if(i==1){if(sum-a[1]<def)printf("%lld\n",def-sum+a[1]);elseprintf("0\n");continue;}ans1+=abs(a[i-1]-atk);if(sum-a[i-1]<def)ans1=ans1+def-(sum-a[i-1]);if(a[i]>=atk){if(sum-a[i]<def)ans2=def-sum+a[i];}else{if(sum-a[i]<def)ans2=def-sum+atk;}printf("%lld\n",min(ans1,ans2));}else//所有数都比龙的攻击值要小{if(sum-a[n]>=def)printf("%lld\n",atk-a[n]);elseprintf("%lld\n",atk+def-sum);}}return 0;
}

//感谢大佬ljl帮我找bug

C. Slay the Dragon相关推荐

slay the dragon
参考了一下tourist的代码 C. Slay the Dragon time limit per test2 seconds memory limit per test256 megabytes i ...
codeforces 1574 C. Slay the Dragon
本场比赛其他题目题解 A. Regular Bracket Sequences B. Combinatorics Homework C. Slay the Dragon D. The Stronges ...
Educational Codeforces Round 114 (Rated for Div. 2)C. Slay the Dragon
题目链接:Problem - 1574C - Codeforces Recently, Petya learned about a new game "Slay the Dragon&quo ...
【Dragon of Loowater】【UVA - 11292】（思维）
题目: Once upon a time, in the Kingdom of Loowater, a mi- nor nuisance turned into a major problem. Th ...
Educational Codeforces Round 114 (Rated for Div. 2) （A ~ F）全题解
整理的算法模板合集: ACM模板点我看算法全家桶系列!!! 实际上是一个全新的精炼模板整合计划 Educational Codeforces Round 114 (Rated for Div. 2) ...
《spring实战第四版》的读书笔记
<spring实战第四版>的读书笔记 1 概述 <Spring实战第四版>描述了Spring4架构的设计,看完了以后,最大感觉是Spring的IOC与aop理念实在是太强大了, ...
Spring实战1：Spring初探
现在的Java程序员赶上了好时候.在将近20年的历史中,Java的发展历经沉浮.尽管有很多为人诟病的产品,例如applets.EJB.Java Data Object(JDO)和数不清的日志框架,Ja ...
spring(1)Spring之旅
[0]README 0.1)本文部分文字描述转自:"Spring In Action(中/英文版)",旨在reviewSpring(1)Spring之旅的相关知识: [1]简化j ...
SQL Server中的查询优化技术：基础
描述 (Description) Fixing and preventing performance problems is critical to the success of any applic ...

C. Slay the Dragon

C. Slay the Dragon相关推荐

最新文章

热门文章