Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

프로세스 #405

Closed
Tracked by #396
fkdl0048 opened this issue Nov 26, 2024 · 0 comments
Closed
Tracked by #396

프로세스 #405

fkdl0048 opened this issue Nov 26, 2024 · 0 comments
Assignees
Milestone

Comments

@fkdl0048
Copy link
Owner

fkdl0048 commented Nov 26, 2024

#include <string>
#include <vector>
#include <queue>

using namespace std;

int solution(vector<int> priorities, int location) {
    queue<pair<int, int>> q;
    priority_queue<int> pq;
    
    for (int i = 0; i < priorities.size(); i++) {
        q.push({i, priorities[i]});
        pq.push(priorities[i]);
    }
    
    int count = 0;
    while (!q.empty()) {
        auto temp = q.front();
        q.pop();
        
        if (pq.top() == temp.second) {
            count++;
            pq.pop();
            if (temp.first == location) {
                return count;
            }
        } else {
            q.push(temp);
        }
    }
    
    return count;
}
@fkdl0048 fkdl0048 self-assigned this Nov 26, 2024
@github-project-automation github-project-automation bot moved this to Todo in Todo Nov 26, 2024
@fkdl0048 fkdl0048 added this to Todo Nov 26, 2024
@fkdl0048 fkdl0048 added this to the Programmers milestone Nov 26, 2024
@fkdl0048 fkdl0048 moved this from Todo to In Progress in Todo Nov 29, 2024
@fkdl0048 fkdl0048 closed this as completed Dec 2, 2024
@github-project-automation github-project-automation bot moved this from In Progress to Done in Todo Dec 2, 2024
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Projects
Status: Done
Development

No branches or pull requests

1 participant