/ SeriousOJ /

Record Detail

Wrong Answer


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 324.0 KiB
#2 Wrong Answer 1ms 324.0 KiB
#3 Wrong Answer 19ms 568.0 KiB
#4 Wrong Answer 21ms 900.0 KiB
#5 Wrong Answer 50ms 5.062 MiB
#6 Wrong Answer 50ms 5.031 MiB
#7 Wrong Answer 31ms 628.0 KiB
#8 Wrong Answer 32ms 632.0 KiB
#9 Wrong Answer 14ms 988.0 KiB
#10 Wrong Answer 21ms 604.0 KiB
#11 Wrong Answer 35ms 2.086 MiB

Code

#include<bits/stdc++.h>
#define endl        '\n'
#define F           first
#define S           second
#define pb          push_back
#define yes         cout<<"YES\n"
#define no          cout<<"NO\n"
#define all(x)      x.begin(),x.end()
#define allr(x)     x.rbegin(),x.rend()
#define error1(x)   cerr<<#x<<" = "<<(x)<<endl
#define error2(a,b) cerr<<"("<<#a<<", "<<#b<<") = ("<<(a)<<", "<<(b)<<")\n";
#define coutall(v)  for(auto &it: v) cout << it << " "; cout << endl;
using namespace std;
using ll = long long;
using ld = long double;

void solve() {
    ll n, m, k, c = 0, ans = 0;
    cin >> n >> k;
    vector<ll> v(n), pre(n + 1);
    for (int i = 0; i < n; i++) {
        ll x; cin >> x;
        v[i] = x;
        pre[i + 1] = pre[i] + x;
    }
    sort(all(v));
    ll sum = pre[n] - pre[n - k];
    ans = n - k;
    for(int i = 0; i < n - k; i++) {
        // cout << i << " ";
        if(sum == pre[i + k] - pre[i]) --ans;
    }
    cout << ans << endl;
    return;
}

signed main() {
    ios::sync_with_stdio(false); cin.tie(0);
    int tc = 1;
    cin >> tc;
    for (int t = 1; t <= tc; t++) {
        // cout << "Case " << t << ": ";
        solve();
    }
    return 0;
}

Information

Submit By
Type
Submission
Problem
P1062 Roy and Array
Contest
Brain Booster #4
Language
C++20 (G++ 13.2.0)
Submit At
2024-07-14 18:30:17
Judged At
2024-10-03 13:35:11
Judged By
Score
5
Total Time
50ms
Peak Memory
5.062 MiB