QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#75539#3025. AssimilationBUET_HaloByte#AC ✓192ms14340kbC++201003b2023-02-05 16:57:132023-02-05 16:57:14

Judging History

你现在查看的是最新测评结果

  • [2023-08-10 23:21:45]
  • System Update: QOJ starts to keep a history of the judgings of all the submissions.
  • [2023-02-05 16:57:14]
  • 评测
  • 测评结果:AC
  • 用时:192ms
  • 内存:14340kb
  • [2023-02-05 16:57:13]
  • 提交

answer

#include<bits/stdc++.h>
using namespace std;
#define int long long
void solve() {
    int n;
    cin >> n;
    int k; cin >> k;
    int aps = 0;
    int a[n + 1]; 
    for(int i = 1; i <= n; i++) cin >> a[i];
    multiset<int> data;
    for (int i=1; i<=n; i++) {
        aps += a[i];
        data.insert(a[i]);
    }
    int cnt = 0;
    int cur = k;


    while(aps > cur) {
        auto it = data.upper_bound(cur);
        //cout <<"->" *it << endl;
        if (it == data.begin()) {
            cout << "-1\n";
            return;
        }
        else {
            it--;
            int val = *it;
            //cout <<"Mobilizing" << val << endl;
            aps -= val;
            data.erase(it);
            cur += val;
            cnt++;
        }
    }

    cout << cnt << "\n";
}
signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);

    int t;
    cin >> t;
    while(t--) {
        solve();
    }
}

详细

Test #1:

score: 100
Accepted
time: 142ms
memory: 14328kb

input:

29
9 1
1 1 2 1 1 1 1 1 1
4 1
3 2 1 1
5 316660370
269357435 105688553 346785866 295093544 181703417
6 43402885
39947441 27068237 43810814 44913378 40095941 34779892
22 319594
3815194 3056481 6593888 7315914 6593888 4794774 2561877 5256242 4920603 5256242 3606645 864746 1594265 1235578 2361430 2277526...

output:

4
2
2
3
-1
10621
4
-1
7
5385
8
2
-1
5
6264
3
0
-1
124764
5
-1
7
10940
1
3
100000
5
-1
-1

result:

ok 29 lines

Test #2:

score: 0
Accepted
time: 192ms
memory: 14340kb

input:

30
1537 2
5 6 3 3 6 5 3 5 5 5 6 5 5 6 4 6 6 6 4 3 5 5 5 6 4 6 2 3 4 5 5 5 5 5 6 6 6 4 4 4 2 6 6 5 3 6 5 6 6 5 6 5 4 3 5 6 4 3 5 3 6 4 5 6 4 1 4 6 4 5 2 4 3 4 6 6 5 5 5 6 6 5 5 5 6 4 5 6 6 6 5 5 5 3 3 2 4 6 3 5 4 4 6 6 6 5 5 6 4 4 6 6 6 6 4 6 6 3 4 5 5 3 4 5 4 6 5 5 6 5 6 6 3 3 6 5 4 6 4 6 6 4 5 3 2 ...

output:

629
22
1452
10
2121
5094
6
1135
7123
2140
4
916
1802
1237
5
6
1498
262
115823
1223
11
1032
844
13
1899
4
1212
17
-1
1797

result:

ok 30 lines

Test #3:

score: 0
Accepted
time: 163ms
memory: 12520kb

input:

30
11 40454552
9677001 192936684 252254034 192936684 37357273 9156546 74500194 116624778 13650360 2174119 13650360
27 1
3 2 3 1 3 5 3 5 1 1 1 1 1 1 4 4 1 1 1 2 1 3 3 1 3 2 4
11 72578887
172937772 206562668 87600829 84557056 103901588 148396091 92438037 215698807 125600579 216304481 191851963
5 1
1 2...

output:

4
9
-1
3
19
-1
5
9
4
4
18
14
5
5
83242
7
4
-1
6
22
5
3
17
-1
2
7
22
158159
-1
12

result:

ok 30 lines