Submission #71848879
Source Code Expand
#include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
#include <climits>
#include <stack>
#include <set>
#include <unordered_map>
#include <string>
#include <cmath>
using namespace std;
using ll = unsigned long long;
void solve() {
int n;
cin >> n;
vector<pair<ll, ll>> a(n);
ll sum = 0;
for (int i = 0; i < n; i++) {
int b, t;
cin >> b >> t;
a[i] = { b,t };
sum += t;
}
vector<ll> st(n);
for (int i = 0; i < n; i++) {
st[i] = a[i].first + a[i].second;
}
sort(st.begin(), st.end());
int ans = 0;
ll cnt = 0;
for (int i = 0; i < n; i++) {
cnt += st[i];
if (cnt <= sum)ans++;
else break;
}
cout << ans << endl;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int tt;
cin >> tt;
while (tt--)solve();
return 0;
}
Submission Info
| Submission Time | |
|---|---|
| Task | C - Reindeer and Sleigh 2 |
| User | alexxy |
| Language | C++23 (GCC 15.2.0) |
| Score | 350 |
| Code Size | 954 Byte |
| Status | AC |
| Exec Time | 49 ms |
| Memory | 10388 KiB |
Judge Result
| Set Name | Sample | All | ||||
|---|---|---|---|---|---|---|
| Score / Max Score | 0 / 0 | 350 / 350 | ||||
| Status |
|
|
| Set Name | Test Cases |
|---|---|
| Sample | 00_sample_00.txt |
| All | 00_sample_00.txt, 01_test_00.txt, 01_test_01.txt, 01_test_02.txt, 01_test_03.txt, 01_test_04.txt, 01_test_05.txt, 01_test_06.txt, 01_test_07.txt, 01_test_08.txt, 01_test_09.txt, 01_test_10.txt, 01_test_11.txt, 01_test_12.txt, 01_test_13.txt, 01_test_14.txt, 01_test_15.txt, 01_test_16.txt, 01_test_17.txt, 01_test_18.txt, 01_test_19.txt, 01_test_20.txt, 01_test_21.txt, 01_test_22.txt, 01_test_23.txt, 01_test_24.txt, 01_test_25.txt, 01_test_26.txt |
| Case Name | Status | Exec Time | Memory |
|---|---|---|---|
| 00_sample_00.txt | AC | 1 ms | 3544 KiB |
| 01_test_00.txt | AC | 48 ms | 3580 KiB |
| 01_test_01.txt | AC | 31 ms | 3788 KiB |
| 01_test_02.txt | AC | 31 ms | 3700 KiB |
| 01_test_03.txt | AC | 31 ms | 3720 KiB |
| 01_test_04.txt | AC | 33 ms | 3788 KiB |
| 01_test_05.txt | AC | 37 ms | 5704 KiB |
| 01_test_06.txt | AC | 40 ms | 10316 KiB |
| 01_test_07.txt | AC | 40 ms | 10384 KiB |
| 01_test_08.txt | AC | 41 ms | 10328 KiB |
| 01_test_09.txt | AC | 41 ms | 3632 KiB |
| 01_test_10.txt | AC | 24 ms | 3756 KiB |
| 01_test_11.txt | AC | 22 ms | 3660 KiB |
| 01_test_12.txt | AC | 24 ms | 3696 KiB |
| 01_test_13.txt | AC | 26 ms | 3892 KiB |
| 01_test_14.txt | AC | 28 ms | 5824 KiB |
| 01_test_15.txt | AC | 28 ms | 10192 KiB |
| 01_test_16.txt | AC | 28 ms | 10192 KiB |
| 01_test_17.txt | AC | 28 ms | 10264 KiB |
| 01_test_18.txt | AC | 49 ms | 3532 KiB |
| 01_test_19.txt | AC | 33 ms | 3776 KiB |
| 01_test_20.txt | AC | 32 ms | 3788 KiB |
| 01_test_21.txt | AC | 32 ms | 3568 KiB |
| 01_test_22.txt | AC | 35 ms | 3836 KiB |
| 01_test_23.txt | AC | 29 ms | 5320 KiB |
| 01_test_24.txt | AC | 41 ms | 10316 KiB |
| 01_test_25.txt | AC | 41 ms | 10388 KiB |
| 01_test_26.txt | AC | 41 ms | 10316 KiB |