Submission #8597652
Source Code Expand
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
int main(void)
{
int d;
cin >> d;
vector<ll> a(d), b(d);
rep(i, d) { cin >> a.at(i); }
rep(i, d) { cin >> b.at(i); }
ll sum = 0;
priority_queue<ll, vector<ll>, greater<ll>> q;
rep(i, d)
{
sum += a.at(i);
if (sum >= b.at(i)) {
q.push(b.at(i));
}
}
if (q.size()) {
cout << q.top() << endl;
} else {
cout << -1 << endl;
}
}
Submission Info
| Submission Time | |
|---|---|
| Task | C - パソコンの購入 |
| User | alteis |
| Language | C++14 (GCC 5.4.1) |
| Score | 100 |
| Code Size | 571 Byte |
| Status | AC |
| Exec Time | 148 ms |
| Memory | 5492 KiB |
Judge Result
| Set Name | Sample | Subtask1 | Subtask2 | Subtask3 | ||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|
| Score / Max Score | 0 / 0 | 20 / 20 | 40 / 40 | 40 / 40 | ||||||||
| Status |
|
|
|
|
| Set Name | Test Cases |
|---|---|
| Sample | sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt |
| Subtask1 | sample_01.txt, sub1_in01.txt, sub1_in02.txt, sub1_in03.txt |
| Subtask2 | sample_01.txt, sample_02.txt, sub1_in01.txt, sub1_in02.txt, sub1_in03.txt, sub2_in01.txt, sub2_in02.txt, sub2_in03.txt, sub2_in04.txt, sub2_in05.txt, sub2_in06.txt |
| Subtask3 | sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt, sub1_in01.txt, sub1_in02.txt, sub1_in03.txt, sub2_in01.txt, sub2_in02.txt, sub2_in03.txt, sub2_in04.txt, sub2_in05.txt, sub2_in06.txt, sub3_in01.txt, sub3_in02.txt, sub3_in03.txt, sub3_in04.txt, sub3_in05.txt, sub3_in06.txt, sub3_in07.txt, sub3_in08.txt, sub3_in09.txt, sub3_in10.txt, sub3_in11.txt, sub3_in12.txt |
| Case Name | Status | Exec Time | Memory |
|---|---|---|---|
| sample_01.txt | AC | 1 ms | 256 KiB |
| sample_02.txt | AC | 1 ms | 256 KiB |
| sample_03.txt | AC | 1 ms | 256 KiB |
| sample_04.txt | AC | 1 ms | 256 KiB |
| sub1_in01.txt | AC | 1 ms | 256 KiB |
| sub1_in02.txt | AC | 1 ms | 256 KiB |
| sub1_in03.txt | AC | 1 ms | 256 KiB |
| sub2_in01.txt | AC | 1 ms | 256 KiB |
| sub2_in02.txt | AC | 1 ms | 256 KiB |
| sub2_in03.txt | AC | 1 ms | 256 KiB |
| sub2_in04.txt | AC | 1 ms | 256 KiB |
| sub2_in05.txt | AC | 1 ms | 256 KiB |
| sub2_in06.txt | AC | 1 ms | 256 KiB |
| sub3_in01.txt | AC | 145 ms | 5492 KiB |
| sub3_in02.txt | AC | 145 ms | 5492 KiB |
| sub3_in03.txt | AC | 144 ms | 5492 KiB |
| sub3_in04.txt | AC | 136 ms | 5492 KiB |
| sub3_in05.txt | AC | 136 ms | 5492 KiB |
| sub3_in06.txt | AC | 134 ms | 3456 KiB |
| sub3_in07.txt | AC | 132 ms | 3328 KiB |
| sub3_in08.txt | AC | 131 ms | 3328 KiB |
| sub3_in09.txt | AC | 132 ms | 3328 KiB |
| sub3_in10.txt | AC | 132 ms | 3328 KiB |
| sub3_in11.txt | AC | 132 ms | 3328 KiB |
| sub3_in12.txt | AC | 148 ms | 5492 KiB |