A. Duff and Meat和Dragons

A. Duff and Meat和Dragons

dragon
A. Dragons
time limit per test2 seconds
memory limit per test256 megabytes
inputstandard input
outputstandard output
Kirito is stuck on a level of the MMORPG he is playing now. To move on in the game, he’s got to defeat all n dragons that live on this level. Kirito and the dragons have strength, which is represented by an integer. In the duel between two opponents the duel’s outcome is determined by their strength. Initially, Kirito’s strength equals s.

If Kirito starts duelling with the i-th (1 ≤ i ≤ n) dragon and Kirito’s strength is not greater than the dragon’s strength x i, then Kirito loses the duel and dies. But if Kirito’s strength is greater than the dragon’s strength, then he defeats the dragon and gets a bonus strength increase by y i.

Kirito can fight the dragons in any order. Determine whether he can move on to the next level of the game, that is, defeat all dragons without a single loss.

Input
The first line contains two space-separated integers s and n (1 ≤ s ≤ 104, 1 ≤ n ≤ 103). Then n lines follow: the i-th line contains space-separated integers x i and y i (1 ≤ x i ≤ 104, 0 ≤ y i ≤ 104) — the i-th dragon’s strength and the bonus for defeating it.

Output
On a single line print “YES” (without the quotes), if Kirito can move on to the next level and print “NO” (without the quotes), if he can’t.

Examples
inputCopy
2 2
1 99
100 0
outputCopy
YES
inputCopy
10 1
100 100
outputCopy
NO
Note
In the first sample Kirito’s strength initially equals 2. As the first dragon’s strength is less than 2, Kirito can fight it and defeat it. After that he gets the bonus and his strength increases to 2 + 99 = 101. Now he can defeat the second dragon and move on to the next level.

In the second sample Kirito’s strength is too small to defeat the only dragon and win.

#include<iostream>
#include<algorithm>
using namespace std;
struct dragon
{
	int x;
	int y;
}b[10005];
bool cmp(dragon &X,dragon &Y)
{
	if(X.x==Y.x)
		return X.y < Y.y;
	return X.x < Y.x; 
}
int main()
{
	int n,m,sum;
	cin>>n>>m;
	for(int i=0;i<m;i++)
	{
		cin>>b[i].x>>b[i].y;
	}
	sort(b,b+m,cmp);
	for(int i=0;i<m;i++)
	{
		if(b[i].x<n)
		{
			n+=b[i].y;
			sum=i;
		}
		else
		break;
    }
	if(sum==m-1)
	{
		cout<<"YES"<<endl;
	}
	else
	{
		cout<<"NO"<<endl;
	}
}

A. Duff and Meat
A. Duff and Meat
time limit per test1 second
memory limit per test256 megabytes
inputstandard input
outputstandard output
Duff is addicted to meat! Malek wants to keep her happy for n days. In order to be happy in i-th day, she needs to eat exactly a i kilograms of meat.

There is a big shop uptown and Malek wants to buy meat for her from there. In i-th day, they sell meat for p i dollars per kilogram. Malek knows all numbers a 1, …, a n and p 1, …, p n. In each day, he can buy arbitrary amount of meat, also he can keep some meat he has for the future.

Malek is a little tired from cooking meat, so he asked for your help. Help him to minimize the total money he spends to keep Duff happy for n days.

Input
The first line of input contains integer n (1 ≤ n ≤ 105), the number of days.

In the next n lines, i-th line contains two integers a i and p i (1 ≤ a i, p i ≤ 100), the amount of meat Duff needs and the cost of meat in that day.

Output
Print the minimum money needed to keep Duff happy for n days, in one line.

Examples
inputCopy
3
1 3
2 2
3 1
outputCopy
10
inputCopy
3
1 3
2 1
3 2
outputCopy
8
Note
In the first sample case: An optimal way would be to buy 1 kg on the first day, 2 kg on the second day and 3 kg on the third day.

In the second sample case: An optimal way would be to buy 1 kg on the first day and 5 kg (needed meat for the second and third day) on the second day.

#include<iostream>
using namespace std;
struct meat
{
	int x;int y;
}b[100005];
int main()
{
	int n,sum=0;
    cin>>n;
	for(int i=0;i<n;i++)
	{
		cin>>b[i].x>>b[i].y;
	}
	for(int i=0;i<n;i++)
	{
		if(b[i].y<b[i+1].y)
		{
			b[i+1].y=b[i].y;
		}
	}
	for(int i=0;i<n;i++)
	{
		sum+=(b[i].x)*(b[i].y);
	}
	cout<<sum<<endl;
}