题解

#include <bits/stdc++.h>
using namespace std;
struct yao{
int tim, many;
} a[100];
int t, m;
int cnt;
bool cmp(yao x,yao y) {
	return x.tim < y.tim;
}
int main() {   
    cin >> t >> m;
    for (int i = 1; i <= m; i ++) {
        cin >> a[i].tim >> a[i].many; 
    }
    sort (a + 1, a + m + 1, cmp);
    for (int i = 1; i <= m; i ++) {
        if(a[i].tim <= t) {
        	t = t - a[i].tim;
        	cnt = cnt + a[i].many;
		}else {
			continue;
		}
    }
    cout << cnt;    
    return 0;
}