Submission #14100

#	Time	Username	Problem	Language	Result	Execution time	Memory
14100		comet	Be Two Bees (OJUZ10_b2b)	C++98	0 / 100	47 ms	4208 KiB

b2b

#include<cstdio>
#include<algorithm>
typedef std::pair<double,int> pp;
#define ll long long
ll p,h[100010],t[100010];
pp s[100010];
int n;
int main(){
	scanf("%d",&n);
	for(int i=0;i<n;i++)scanf("%lld",&h[i]),p+=h[i];
	for(int i=0;i<n;i++)scanf("%lld",&t[i]);
	for(int i=0;i<n;i++)s[i]=pp((double)(p-h[i])/(double)t[i],i);
	sort(s,s+n);
	printf("%d %d\n",s[0].second,s[1].second);
}

• Subtask 1: 0 / 11
• Subtask 2: 0 / 22
• Subtask 3: 0 / 28
• Subtask 4: 0 / 39