Submission #1770461
Source Code Expand
#include <iostream> #include <queue> using namespace std; int main(int argc, char **argv) { int N, K; cin >> N >> K; priority_queue<int, vector<int>, greater<int> > pque; for (int i = 0; i < N; ++i) { int a, b; cin >> a >> b; for (int j = 0; j < b; ++j) { pque.push(a); } } for (int i = 0; i < K - 1; ++i) { pque.pop(); } cout << pque.top() << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - Big Array |
User | KuroUron |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 465 Byte |
Status | TLE |
Exec Time | 2126 ms |
Memory | 1515596 KB |
Judge Result
Set Name | Sample | All | ||||||||
---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 300 | ||||||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample_01.txt, sample_02.txt |
All | sample_01.txt, sample_02.txt, subtask_1_1.txt, subtask_1_10.txt, subtask_1_11.txt, subtask_1_12.txt, subtask_1_13.txt, subtask_1_14.txt, subtask_1_15.txt, subtask_1_2.txt, subtask_1_3.txt, subtask_1_4.txt, subtask_1_5.txt, subtask_1_6.txt, subtask_1_7.txt, subtask_1_8.txt, subtask_1_9.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample_01.txt | AC | 1 ms | 256 KB |
sample_02.txt | AC | 34 ms | 4848 KB |
subtask_1_1.txt | AC | 1341 ms | 132572 KB |
subtask_1_10.txt | TLE | 2111 ms | 256 KB |
subtask_1_11.txt | TLE | 2111 ms | 256 KB |
subtask_1_12.txt | TLE | 2103 ms | 256 KB |
subtask_1_13.txt | TLE | 2111 ms | 256 KB |
subtask_1_14.txt | TLE | 2111 ms | 256 KB |
subtask_1_15.txt | TLE | 2111 ms | 256 KB |
subtask_1_2.txt | TLE | 2117 ms | 1050448 KB |
subtask_1_3.txt | TLE | 2126 ms | 1402316 KB |
subtask_1_4.txt | TLE | 2124 ms | 1459148 KB |
subtask_1_5.txt | TLE | 2121 ms | 1464012 KB |
subtask_1_6.txt | AC | 38 ms | 4848 KB |
subtask_1_7.txt | MLE | 373 ms | 263128 KB |
subtask_1_8.txt | TLE | 2124 ms | 1515596 KB |
subtask_1_9.txt | TLE | 2124 ms | 1497548 KB |