acm 第七天：贪心

#include <iostream> 
#include <algorithm> 
using namespace std; 

int main()
{
	int n, m, v[1024], res = 0, x, y ; 
	cin >> n >> m ;
	for(int i = 1; i <= n; i++)
		cin >> v[i] ; 
	while(m--)
	{
		cin >> x >> y ; 
		res += min(v[x], v[y]) ; 
	}
	cout << res << endl ;
	return 0 ; 
}

#include <iostream>
#include <algorithm>
#include "queue"

using namespace std;
const int maxn = 1e4;

struct node {
    int minspf, maxspf;
} e[maxn];
int spf[maxn];

bool cmp(node a, node b) {
    return a.minspf > b.minspf;
}

int main() {
    int c, l;
    cin >> c >> l;
    for (int i = 0; i < c; i++) {
        cin >> e[i].minspf >> e[i].maxspf;
    }
    int a, b;
    for (int i = 0; i < l; i++) {
        cin >> a >> b;
        spf[a] += b;
    }
    int ans = 0;
    sort(e, e + c, cmp);
    for (int i = 0; i < c; i++) {
        for (int j = e[i].maxspf; j >= e[i].minspf; j--) {
            if (spf[j] > 0) {
                spf[j]--;
                ans++;
                break;
            }
        }
    }
    cout<<ans<<endl<<endl;
    return 0;
}

#include <iostream>
#include <algorithm>
#include <queue>
using namespace std;

const int maxn = 1e5;
struct node{
    int start,endd;
}e[maxn];
bool cmp(node a,node b){
    if(a.endd!=b.endd)
        return a.endd<b.endd;
    return a.start<b.start;
}
int main()
{
    int n;
    while(scanf("%d",&n),n!=0){
        
        for(int i=0;i<n;i++){
            cin>>e[i].start>>e[i].endd;
        }
        sort(e,e+n,cmp);
        int now=0;
        int ans=0;
        for(int i=0;i<n;i++)
        {
            if(e[i].start>=now){
                now=e[i].endd;
                ans++;
            }
        }
        cout<<ans<<endl;
    }
    return 0;
}