D. Gadgets for dollars and pounds

题目连接:

http://www.codeforces.com/contest/609/problem/C

Description

Nura wants to buy k gadgets. She has only s burles for that. She can buy each gadget for dollars or for pounds. So each gadget is selling only for some type of currency. The type of currency and the cost in that currency are not changing.

Nura can buy gadgets for n days. For each day you know the exchange rates of dollar and pound, so you know the cost of conversion burles to dollars or to pounds.

Each day (from 1 to n) Nura can buy some gadgets by current exchange rate. Each day she can buy any gadgets she wants, but each gadget can be bought no more than once during n days.

Help Nura to find the minimum day index when she will have k gadgets. Nura always pays with burles, which are converted according to the exchange rate of the purchase day. Nura can't buy dollars or pounds, she always stores only burles. Gadgets are numbered with integers from 1 to m in order of their appearing in input.

Input

First line contains four integers n, m, k, s (1 ≤ n ≤ 2·105, 1 ≤ k ≤ m ≤ 2·105, 1 ≤ s ≤ 109) — number of days, total number and required number of gadgets, number of burles Nura has.

Second line contains n integers ai (1 ≤ ai ≤ 106) — the cost of one dollar in burles on i-th day.

Third line contains n integers bi (1 ≤ bi ≤ 106) — the cost of one pound in burles on i-th day.

Each of the next m lines contains two integers ti, ci (1 ≤ ti ≤ 2, 1 ≤ ci ≤ 106) — type of the gadget and it's cost. For the gadgets of the first type cost is specified in dollars. For the gadgets of the second type cost is specified in pounds.

Output

If Nura can't buy k gadgets print the only line with the number -1.

Otherwise the first line should contain integer d — the minimum day index, when Nura will have k gadgets. On each of the next k lines print two integers qi, di — the number of gadget and the day gadget should be bought. All values qi should be different, but the values di can coincide (so Nura can buy several gadgets at one day). The days are numbered from 1 to n.

In case there are multiple possible solutions, print any of them.

Sample Input

5 4 2 2

1 2 3 2 1

3 2 1 2 3

1 1

2 1

1 2

2 2

Sample Output

3

1 1

2 3

Hint

题意

有n天,一共有m个物品,你需要买k个,你身上有s元人民币。每一天,人民币兑换美元的价格为a[i],兑换英镑的价格为b[i]。

购买第i种物品,必须要用c[i]块t[i]货币来购买。然后问你最少多少天之内,可以买够t个物品,并且输出哪一天买哪一个物品。

题解:

二分答案。二分天数,很显然我们在这一个范围内,我们在这个范围内兑换美元和英镑最便宜的时候购买,物品则是兑换钱的时候买,然后check花费是否大于s就好了。

代码

#include<bits/stdc++.h>
using namespace std;
inline long long read()
{
long long x=0,f=1;char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
return x*f;
}
#define maxn 200005
int n,m,k;
int s;
int Mia[maxn],Mib[maxn];
int a[maxn],b[maxn];
long long suma[maxn],sumb[maxn];
int pm1[maxn],pm2[maxn];
vector<pair<int,int> > c1,c2;
int check(int mid)
{
long long mi = 1e18;
int top = min(k,(int)c1.size()-1);
for(int i=0;i<=top;i++)
{
int i1 = i;
int i2 = k-i;
if(i2>=c2.size())continue;
mi = min(mi,1LL*suma[i1]*Mia[mid]+1LL*sumb[i2]*Mib[mid]);
} if(mi>s)return 0;
return 1;
}
int main()
{
scanf("%d%d%d%d",&n,&m,&k,&s);
Mia[0]=1e18;Mib[0]=1e18;
for(int i=1;i<=n;i++)
{
a[i]=read();
Mia[i]=min(a[i],Mia[i-1]);
if(a[i]>=Mia[i-1])pm1[i]=pm1[i-1];
else pm1[i]=i;
}
for(int i=1;i<=n;i++)
{
b[i]=read();
Mib[i]=min(b[i],Mib[i-1]);
if(b[i]>=Mib[i-1])pm2[i]=pm2[i-1];
else pm2[i]=i;
}
Mia[0]=0;Mib[0]=0;
for(int i=1;i<=m;i++)
{
int t,c;
t=read(),c=read();
if(t==1)c1.push_back(make_pair(c,i));
else c2.push_back(make_pair(c,i));
}
c1.push_back(make_pair(0,0));
c2.push_back(make_pair(0,0));
sort(c1.begin(),c1.end());
sort(c2.begin(),c2.end());
for(int i=1;i<c1.size();i++)
suma[i]=c1[i].first+suma[i-1];
for(int i=0;i<c2.size();i++)
sumb[i]=c2[i].first+sumb[i-1];
int l = 1,r = n+1;
while(l<=r)
{
int mid = (l+r)/2;
if(check(mid))r=mid-1;
else l=mid+1;
}
if(l>=n+1)return puts("-1");
printf("%d\n",l);
long long mi = 1e18;
int top = min(k,(int)c1.size()-1);
for(int i=0;i<=top;i++)
{
int i1 = i;
int i2 = k-i;
if(i2>=c2.size())continue;
mi = min(mi,1LL*suma[i1]*Mia[l]+1LL*sumb[i2]*Mib[l]);
}
for(int i=0;i<=top;i++)
{
int i1 = i;
int i2 = k-i;
if(i2>=c2.size())continue;
if(suma[i1]*Mia[l]+sumb[i2]*Mib[l]==mi)
{
for(int j=1;j<=i1;j++)
printf("%d %d\n",c1[j].second,pm1[l]);
for(int j=1;j<=i2;j++)
printf("%d %d\n",c2[j].second,pm2[l]);
return 0;
}
}
}

Codeforces Educational Codeforces Round 3 D. Gadgets for dollars and pounds 二分,贪心的更多相关文章

  1. Educational Codeforces Round 3 D. Gadgets for dollars and pounds 二分+前缀

    D. Gadgets for dollars and pounds time limit per test 2 seconds memory limit per test 256 megabytes ...

  2. codeforces 609D D. Gadgets for dollars and pounds(二分+贪心)

    题目链接: D. Gadgets for dollars and pounds time limit per test 2 seconds memory limit per test 256 mega ...

  3. CF# Educational Codeforces Round 3 D. Gadgets for dollars and pounds

    D. Gadgets for dollars and pounds time limit per test 2 seconds memory limit per test 256 megabytes ...

  4. CodeForce---Educational Codeforces Round 3 D. Gadgets for dollars and pounds 正题

    对于这题笔者无解,只有手抄一份正解过来了: 基本思想就是 : 二分答案,对于第x天,计算它最少的花费f(x),<=s就是可行的,这是一个单调的函数,所以可以二分. 对于f(x)的计算,我用了nl ...

  5. Codeforces Educational Codeforces Round 44 (Rated for Div. 2) F. Isomorphic Strings

    Codeforces Educational Codeforces Round 44 (Rated for Div. 2) F. Isomorphic Strings 题目连接: http://cod ...

  6. Codeforces Educational Codeforces Round 44 (Rated for Div. 2) E. Pencils and Boxes

    Codeforces Educational Codeforces Round 44 (Rated for Div. 2) E. Pencils and Boxes 题目连接: http://code ...

  7. Gadgets for dollars and pounds CodeForces - 609D

    Nura wants to buy k gadgets. She has only sburles for that. She can buy each gadget for dollars or f ...

  8. codeforces Educational Codeforces Round 5 A. Comparing Two Long Integers

    题目链接:http://codeforces.com/problemset/problem/616/A 题目意思:顾名思义,就是比较两个长度不超过 1e6 的字符串的大小 模拟即可.提供两个版本,数组 ...

  9. codeforces Educational Codeforces Round 16-E(DP)

    题目链接:http://codeforces.com/contest/710/problem/E 题意:开始文本为空,可以选择话费时间x输入或删除一个字符,也可以选择复制并粘贴一串字符(即长度变为两倍 ...

随机推荐

  1. [转]Linux中文件权限目录权限的意义及权限对文件目录的意义

    转自:http://www.jb51.net/article/77458.htm linux中目录与文件权限的意义 一.文件权限的意义 r:可以读这个文件的具体内容: w:可以编辑这个文件的内容,包括 ...

  2. 【LeetCode】58 - Length of Last Word

    Given a string s consists of upper/lower-case alphabets and empty space characters ' ', return the l ...

  3. JS获得月最后一天和js得到一个月最大天数

    <html xmlns="http://www.w3.org/1999/xhtml" > <head> <title>标题页</title ...

  4. POJ2406----Power Strings解题报告

    Power Strings Time Limit: 3000MS   Memory Limit: 65536K Total Submissions: 43514   Accepted: 18153 D ...

  5. mysql如果搜索长度过宽 导致显示不全的情况解决

    今天我在搜索数据库里面优惠码字段 直接使用 select * from table 的命令的时候 由于 第一个 字段过长导致后面的都无法显示全..我还是宽屏! 所以 搜索了一下 可以让 它单行显示 使 ...

  6. Hadoop概念学习系列之hadoop生态系统闲谈(二十五)

    分层次讲解 最底层平台 ------->hdfs  yarn  mapreduce spark 应用层-------->hbase  hive   pig   sparkSQL    nu ...

  7. css斜线

    斜线 .demo{ display: inline-block; width: 400px; height: 100px; resize: both; overflow: auto; margin-t ...

  8. HDu 1001 Sum Problem 分类: ACM 2015-06-19 23:38 12人阅读 评论(0) 收藏

    Sum Problem Time Limit: 1000/500 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total ...

  9. Java(07)转化流

    查看API得知: public class OutputStreamWriter extends Writer public class InputStreamReader extends Reade ...

  10. [转载]开机出现A disk read error occurred错误

    [此文章转载] 今天维修了一台机器,郁闷之极.最开始一直无法正确安装操作系统,一安装总是提示文件无法写入内存.换了光盘.光驱都无济于事,忽然意识到是不是内存的问题,随即找了一个内存来,替换了一下,更郁 ...