tarefas.cpp

#include <iostream>
#include <vector>
#include <algorithm>
 
using namespace std;
 
class valorHora{
 
public:
    int valor;
    int hora;
};
 
struct ordePrimCol{
    bool operator()(const valorHora& lhs, const valorHora& rhs) const{
        if(lhs.valor > rhs.valor){
            return true;
        }
        if(lhs.valor == rhs.valor){
            return lhs.hora > rhs.hora;
        }
        return false;
    }
};
 
int main(){
    ios::sync_with_stdio(false);
    int n = 0, h = 0;
 
    while(cin >> n >> h){
        int resto = 0, x = 0, y = 0, menor = 0;
        vector<valorHora> th(n);
        vector<bool> tarefas(h, false);
 
        for(int i = 0; i < n; i++){
            cin >> x >> y;
            th[i].valor = x;
            th[i].hora = y;
            resto += x;
        }
 
        sort(th.begin(), th.end(), ordePrimCol());
 
        for(int l = 0; l < n; l++){
            menor = min(h, th[l].hora);
            for(int k = menor - 1; k >= 0; k--){
                if(tarefas[k] == false){
                    tarefas[k] = true;
                    resto -= th[l].valor; //VOCÊ TINHA COLOCADO th[k]
                    break;
                }
            }
        }
 
        cout << resto << endl;
 
    }
 
    return 0;
}