题目链接：http://codeforces.com/contest/1015/problem/C
就是输入n和m，m为存储空间
然后n行a和b a大于b
每一行的a可以压缩为b的大小
求最少只需要压缩几个，使得m可以存下所有数据
如果全部压缩都不满足，就输出-1
#include <stdio.h>
#include <iostream>
#include <string.h>
#include <algorithm>
#include <map>
#include <vector>
#define ll long long
using namespace std;
const int maxn=1e5+10;
ll a[maxn],b[maxn],c[maxn];
bool cmp(ll a,ll b)
{
return a>b;
}
int main()
{
ll n,m;
while(scanf("%lld%lld",&n,&m)!=EOF)
{ ll sum1=0,sum2=0,sum3;
for(int i=1;i<=n;i++)
{
scanf("%lld%lld",&a[i],&b[i]);
sum1+=a[i];
sum2+=b[i];
c[i]=a[i]-b[i];
}
sort(c+1,c+n+1,cmp);
// cout<<sum1<<" "<<sum2<<endl;
int i=1;
int ans=0;
if(sum2>m)printf("-1\n");
else{
ll t=sum1-m;
while(t>0)
{
//cout<<c[i]<<" "<<t<<endl;
t-=c[i++];
ans++;
}
printf("%d\n",ans);
}
}
return 0;
}
C. Songs Compression
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output
Ivan has nn songs on his phone. The size of the ii-th song is aiai bytes. Ivan also has a flash drive which can hold at most mm bytes in total. Initially, his flash drive is empty.
Ivan wants to copy all nn songs to the flash drive. He can compress the songs. If he compresses the ii-th song, the size of the ii-th song reduces from aiai to bibi bytes (bi<aibi<ai).
Ivan can compress any subset of the songs (possibly empty) and copy all the songs to his flash drive if the sum of their sizes is at most mm. He can compress any subset of the songs (not necessarily contiguous).
Ivan wants to find the minimum number of songs he needs to compress in such a way that all his songs fit on the drive (i.e. the sum of their sizes is less than or equal to mm).
If it is impossible to copy all the songs (even if Ivan compresses all the songs), print "-1". Otherwise print the minimum number of songs Ivan needs to compress.
Input
The first line of the input contains two integers nn and mm (1≤n≤105,1≤m≤1091≤n≤105,1≤m≤109) — the number of the songs on Ivan's phone and the capacity of Ivan's flash drive.
The next nn lines contain two integers each: the ii-th line contains two integers aiai and bibi (1≤ai,bi≤1091≤ai,bi≤109, ai>biai>bi) — the initial size of the ii-th song and the size of the ii-th song after compression.
Output
If it is impossible to compress a subset of the songs in such a way that all songs fit on the flash drive, print "-1". Otherwise print the minimum number of the songs to compress.
Examples
input
Copy
4 21 10 8 7 4 3 1 5 4
output
Copy
2
input
Copy
4 16 10 8 7 4 3 1 5 4
output
Copy
-1
Note
In the first example Ivan can compress the first and the third songs so after these moves the sum of sizes will be equal to 8+7+1+5=21≤218+7+1+5=21≤21. Also Ivan can compress the first and the second songs, then the sum of sizes will be equal 8+4+3+5=20≤218+4+3+5=20≤21. Note that compressing any single song is not sufficient to copy all the songs on the flash drive (for example, after compressing the second song the sum of sizes will be equal to 10+4+3+5=22>2110+4+3+5=22>21).
In the second example even if Ivan compresses all the songs the sum of sizes will be equal 8+4+1+4=17>168+4+1+4=17>16.