Submission #73158583

Source Code Expand

#include <algorithm>
//#include <atcoder/all>
//#include <array>
//#include <bitset>
//#include <cmath>
//#include <deque>
#include <iostream>
#include <map>
//#include <numeric>
#include <queue>
//#include <ranges>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define pb push_back
#define fr first
#define sc second
#define sor(v) sort(v.begin(), v.end())
#define rev(v) reverse(v.begin(), v.end())
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using pint = pair<int,int>;
//using pll = pair<ll,ll>;
//using pqdec = priority_queue<int,vector<int>,greater<int>>;
//using pqdecl = priority_queue<ll,vector<ll>,greater<ll>>;
template <typename T>
using graph = vector<vector<T>>;
const ll LLMAX = 9223372*1e10;
const int IMAX = 214*1e7;
/*--------考察--------------------
----------CODING----------------*/
int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int n, k; cin >> n >> k;
    vector<int> d(n);
    rep(i,n)cin >> d[i];
    sor(d);
    ll ans = 0;
    rep(i,n-k){ans += d[i];}
    cout << ans << endl;
}

Submission Info

Submission Time
Task C - Discount Coupon
User scotch_at
Language C++23 (GCC 15.2.0)
Score 300
Code Size 1164 Byte
Status AC
Exec Time 23 ms
Memory 4244 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 300 / 300
Status
AC × 3
AC × 69
Set Name Test Cases
Sample sample01.txt, sample02.txt, sample03.txt
All sample01.txt, sample02.txt, sample03.txt, in01.txt, in02.txt, in03.txt, in04.txt, in05.txt, in06.txt, in07.txt, in08.txt, in09.txt, in10.txt, in11.txt, in12.txt, in13.txt, in14.txt, in15.txt, in16.txt, in17.txt, in18.txt, in19.txt, in20.txt, in21.txt, in22.txt, in23.txt, in24.txt, in25.txt, in26.txt, in27.txt, in28.txt, in29.txt, in30.txt, in31.txt, in32.txt, in33.txt, in34.txt, in35.txt, in36.txt, in37.txt, in38.txt, in39.txt, in40.txt, in41.txt, in42.txt, in43.txt, in44.txt, in45.txt, in46.txt, in47.txt, in48.txt, in49.txt, in50.txt, in51.txt, in52.txt, in53.txt, in54.txt, in55.txt, in56.txt, in57.txt, in58.txt, in59.txt, in60.txt, in61.txt, in62.txt, in63.txt, in64.txt, in65.txt, in66.txt
Case Name Status Exec Time Memory
in01.txt AC 1 ms 3556 KiB
in02.txt AC 1 ms 3584 KiB
in03.txt AC 1 ms 3624 KiB
in04.txt AC 1 ms 3556 KiB
in05.txt AC 1 ms 3556 KiB
in06.txt AC 1 ms 3596 KiB
in07.txt AC 1 ms 3624 KiB
in08.txt AC 23 ms 4172 KiB
in09.txt AC 22 ms 4236 KiB
in10.txt AC 12 ms 4040 KiB
in11.txt AC 22 ms 4152 KiB
in12.txt AC 23 ms 4228 KiB
in13.txt AC 11 ms 4244 KiB
in14.txt AC 11 ms 4168 KiB
in15.txt AC 23 ms 4196 KiB
in16.txt AC 22 ms 4236 KiB
in17.txt AC 11 ms 4168 KiB
in18.txt AC 1 ms 3624 KiB
in19.txt AC 23 ms 4140 KiB
in20.txt AC 22 ms 4040 KiB
in21.txt AC 11 ms 4148 KiB
in22.txt AC 11 ms 4236 KiB
in23.txt AC 10 ms 4092 KiB
in24.txt AC 9 ms 4148 KiB
in25.txt AC 9 ms 4092 KiB
in26.txt AC 23 ms 4152 KiB
in27.txt AC 22 ms 4168 KiB
in28.txt AC 9 ms 4040 KiB
in29.txt AC 11 ms 3740 KiB
in30.txt AC 1 ms 3620 KiB
in31.txt AC 1 ms 3584 KiB
in32.txt AC 1 ms 3624 KiB
in33.txt AC 1 ms 3460 KiB
in34.txt AC 11 ms 4236 KiB
in35.txt AC 18 ms 4196 KiB
in36.txt AC 1 ms 3468 KiB
in37.txt AC 1 ms 3584 KiB
in38.txt AC 1 ms 3404 KiB
in39.txt AC 1 ms 3584 KiB
in40.txt AC 1 ms 3520 KiB
in41.txt AC 1 ms 3584 KiB
in42.txt AC 1 ms 3636 KiB
in43.txt AC 1 ms 3636 KiB
in44.txt AC 22 ms 4148 KiB
in45.txt AC 1 ms 3404 KiB
in46.txt AC 1 ms 3624 KiB
in47.txt AC 22 ms 4152 KiB
in48.txt AC 23 ms 4092 KiB
in49.txt AC 22 ms 4040 KiB
in50.txt AC 1 ms 3584 KiB
in51.txt AC 1 ms 3460 KiB
in52.txt AC 22 ms 4236 KiB
in53.txt AC 1 ms 3636 KiB
in54.txt AC 1 ms 3636 KiB
in55.txt AC 1 ms 3624 KiB
in56.txt AC 1 ms 3624 KiB
in57.txt AC 1 ms 3584 KiB
in58.txt AC 1 ms 3624 KiB
in59.txt AC 1 ms 3404 KiB
in60.txt AC 1 ms 3624 KiB
in61.txt AC 1 ms 3556 KiB
in62.txt AC 1 ms 3624 KiB
in63.txt AC 1 ms 3584 KiB
in64.txt AC 1 ms 3520 KiB
in65.txt AC 1 ms 3636 KiB
in66.txt AC 1 ms 3628 KiB
sample01.txt AC 1 ms 3520 KiB
sample02.txt AC 1 ms 3584 KiB
sample03.txt AC 1 ms 3620 KiB