Confronta il testo

Trova la differenza tra due file di testo

Editor live

Comprimi invariate

Senza a capo

Layout

Livello di dettaglio

Evidenziazione sintassi

Diffchecker Desktop Il modo più sicuro per usare Diffchecker. Ottieni l'app Diffchecker Desktop: i tuoi diff non lasciano mai il tuo computer!Ottieni Desktop

Untitled Diff

Creato 6 anni faIl diff non scade mai

3 rimozioni

Linee
Totale
Rimosso

Caratteri
Totale
Rimosso

Per continuare a utilizzare questa funzione, aggiorna a Diffchecker Pro Visualizza prezzi

50 linee

5 aggiunte

Linee
Totale
Aggiunto

Caratteri
Totale
Aggiunto

Per continuare a utilizzare questa funzione, aggiorna a Diffchecker Pro Visualizza prezzi

50 linee

#include <bits/stdc++.h>

using namespace std;

typedef long long ull;

typedef unsigned long long ull;

struct cashier {

int id, maxTime, cashierId;

};

struct comp {

bool operator() (cashier a, cashier b) {

if(a.maxTime==b.maxTime) return a.cashierId > b.cashierId;

return a.maxTime > b.maxTime;

}

};

bool compV(cashier a, cashier b) {

if(a.maxTime==b.maxTime) return a.cashierId > b.cashierId;

return a.maxTime < b.maxTime;

}

int main(int argc, const char * argv[]) {

int n, cashierNum;

cin >> n >> cashierNum;

priority_queue<cashier, vector<cashier>, comp> line;

vector<cashier> popLine;

ull ret = 0;

for (int i=0; i<n; i++) {

int id, w;

cin >> id >> w;

if(i<cashierNum) {

line.push({id, w, i+1});

continue;

}

line.push({id, w+line.top().maxTime, line.top().cashierId});

popLine.push_back(line.top());

line.pop();

}

while (line.size()) {

while (!line.empty()) { // 이 줄만 수정했습니다.

popLine.push_back(line.top());

line.pop();

}

sort(popLine.begin(), popLine.end(), compV);

for (int i=0; i<popLine.size(); i++) {

for (int i=0; i<n; i++) {

ret += (ull)((i+1)*(ull)popLine[i].id);

ret += (ull)((i+1)*popLine[i].id);

}

cout << ret << "\n";

return 0;

}

Diff salvati

Testo originale

Apri file

#include <bits/stdc++.h>

using namespace std;

typedef long long ull;

struct cashier {
    int id, maxTime, cashierId;
};

struct comp {
    bool operator() (cashier a, cashier b) {
        if(a.maxTime==b.maxTime) return a.cashierId > b.cashierId;
        return a.maxTime > b.maxTime;
    }
};

bool compV(cashier a, cashier b) {
    if(a.maxTime==b.maxTime) return a.cashierId > b.cashierId;
    return a.maxTime < b.maxTime;
}

int main(int argc, const char * argv[]) {
    int n, cashierNum;
    cin >> n >> cashierNum;
    priority_queue<cashier, vector<cashier>, comp> line;
    vector<cashier> popLine;
    ull ret = 0;
    for (int i=0; i<n; i++) {
        int id, w;
        cin >> id >> w;
        if(i<cashierNum) {
            line.push({id, w, i+1});
            continue;
        }
        line.push({id, w+line.top().maxTime, line.top().cashierId});
        popLine.push_back(line.top());
        line.pop();
    }
    while (line.size()) {
        popLine.push_back(line.top());
        line.pop();
    }
    sort(popLine.begin(), popLine.end(), compV);
    for (int i=0; i<popLine.size(); i++) {
        ret += (ull)((i+1)*(ull)popLine[i].id);
    }
    cout << ret << "\n";
    return 0;
}

Testo modificato

Apri file

#include <bits/stdc++.h>

using namespace std;

typedef unsigned long long ull;

struct cashier {
    int id, maxTime, cashierId;
};

struct comp {
    bool operator() (cashier a, cashier b) {
        if(a.maxTime==b.maxTime) return a.cashierId > b.cashierId;
        return a.maxTime > b.maxTime;
    }
};

bool compV(cashier a, cashier b) {
    if(a.maxTime==b.maxTime) return a.cashierId > b.cashierId;
    return a.maxTime < b.maxTime;
}

int main(int argc, const char * argv[]) {
    int n, cashierNum;
    cin >> n >> cashierNum;
    priority_queue<cashier, vector<cashier>, comp> line;
    vector<cashier> popLine;
    ull ret = 0;
    for (int i=0; i<n; i++) {
        int id, w;
        cin >> id >> w;
        if(i<cashierNum) {
            line.push({id, w, i+1});
            continue;
        }
        line.push({id, w+line.top().maxTime, line.top().cashierId});
        popLine.push_back(line.top());
        line.pop();
    }
    while (!line.empty()) { // 이 줄만 수정했습니다.
        popLine.push_back(line.top());
        line.pop();
    }
    sort(popLine.begin(), popLine.end(), compV);
    for (int i=0; i<n; i++) {
        ret += (ull)((i+1)*popLine[i].id);
    }
    cout << ret << "\n";
    return 0;
}