Algorithm Problem:Greed

A. Greed
time limit per test2 seconds
memory limit per test256 megabytes
inputstandard input
outputstandard output
Jafar has n cans of cola. Each can is described by two integers: remaining volume of cola ai and can’s capacity bi (ai ≤ bi).

Jafar has decided to pour all remaining cola into just 2 cans, determine if he can do this or not!

Input
The first line of the input contains one integer n (2 ≤ n ≤ 100 000) — number of cola cans.

The second line contains n space-separated integers a1, a2, …, an (0 ≤ ai ≤ 109) — volume of remaining cola in cans.

The third line contains n space-separated integers that b1, b2, …, bn (ai ≤ bi ≤ 109) — capacities of the cans.

Output
Print “YES” (without quotes) if it is possible to pour all remaining cola in 2 cans. Otherwise print “NO” (without quotes).

You can print each letter in any case (upper or lower).

My Answer Code:

/*Author:Albert Tesla WizardTime:2020/10/29 14:37
*/
#include<bits/stdc++.h>
using namespace std;
using ull=unsigned long long;
struct can
{ull volume;ull capacity;
};
bool cmp(can a,can b)
{return a.capacity<=b.capacity;
}
int main()
{ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);int n;ull sum=0;cin>>n;vector<can>a(n);for(int i=0;i<n;i++){cin>>a[i].volume;}for(int i=0;i<n;i++)cin>>a[i].capacity;if(n==2){cout<<"YES"<<endl;return 0;}for(int i=0;i<n;i++){sum+=a[i].volume;if(sum>2000000000){cout<<"NO"<<endl;return 0;}}sort(a.begin(),a.end(),cmp);if(a[n-2].capacity+a[n-1].capacity>=sum){cout<<"YES"<<endl;}else cout<<"NO"<<endl;return 0;
}

Algorithm Problem:Greed相关推荐

servlet解析演进（2-1）
2019独角兽企业重金招聘Python工程师标准>>> 上文说了简单的servlet解析过程.实际上,tomcat在解析servlet的时候是吧连接器定位为满足以下三个条件: 1. ...
宝剑锋从磨砺出——使用在线评测平台磨砺C#使用能力
学数学的时候,我们通常会通过大量的练习题来巩固所学知识:其实学习程序设计设计语言也不例外.那么如何通过练习去磨砺自己的C#使用能力呢?一个方法是参与到实际的软件项目开发中,而另一个更加直接的方法则是& ...
tomcat(14)服务器组件和服务组件
[0]README 0.1)本文部分文字描述转自 "how tomcat works",旨在学习 "tomcat(14)服务器组件和服务组件" 的基础知识: 0 ...
tomcat(4)Tomcat的默认连接器
[0]README 0.0)本文部分文字描述转自:"深入剖析tomcat",旨在学习 tomat(4)Tomat的默认连接器的基础知识: 0.1)Tomcat中的连接器是一个独立 ...
如何在Python编码面试中脱颖而出
You've made it past the phone call with the recruiter, and now it's time to show that you know how t ...
一场CF的台前幕后（上）
(重发下这篇原发于 2014-06-03的网易博客) 等你等了五千年,只为这一刹那的回眸一笑. 前奏大约4月份的时候,业界毒瘤pyx噔噔噔跑过来说:"酷爱!我YY了一道题!准备当CF的C& ...
OpenPR开源代码项目
欢迎大家访问OpenPR主页: http://www.openpr.org.cn , 并提出意见和建议!同时,OpenPR也期待您分享您的代码! OpenPR, stands for Open Pa ...
开源工具：OpenPR
欢迎大家访问OpenPR主页: http://www.openpr.org.cn, 并提出意见和建议!同时,OpenPR也期待您分享您的代码! OpenPR, stands for Open Patt ...
一场CF的台前幕后（上）——转
前奏大约4月份的时候,业界毒瘤pyx噔噔噔跑过来说:"酷爱!我YY了一道题!准备当CF的C" 我当时就被吓傻了."Yet another Chinese round?& ...

Algorithm Problem:Greed

Algorithm Problem:Greed相关推荐

最新文章

热门文章