제출 #1266699

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1266699		ilovewaguri	Stove (JOI18_stove)	C++20	100 / 100	12 ms	1476 KiB

stove

#include<bits/stdc++.h>
using namespace std;
#define NAME "STOVE"
#define nl '\n'
#define allofa(x,sz) x,x+sz+1
#define allof(x) x.begin(),x.end()
#define allof1(x) x.begin()+1,x.end()
#define mset(x,val) memset(x,val,sizeof(x))
#define couf(x) cout << fixed << setprecision(x)
template<class T> T Abs(T &x) {return (x>=0 ? x : -x);};
template<class X,class Y> bool minimize(X &a, Y b){if(a>b) {a=b;return true;}return false;};
template<class X,class Y> bool maximize(X &a, Y b){if(a<b) {a=b;return true;}return false;};
typedef long long ll;
const ll mod = (long long)1e9+7;
const ll LINF = (long long)1e15;
const int INF = (int)1e9;

void ccps() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
    if(fopen(NAME".inp","r")) {
        freopen(NAME".inp","r",stdin);
        freopen(NAME".out","w",stdout);
    }
}

signed main() {
    ccps();
    int n,k; cin >> n >> k;
    int a[n+1];
    vector<int> diff;
    for (int i = 1; i<=n; i++) {
        cin >> a[i];
    }
    int res = a[n]-a[1]+1;
    for (int i = 1; i<n; i++) {
        diff.push_back(a[i+1]-a[i]);
    }
    sort(allof(diff),greater<int>());
    for (int i = 0; i<=k-2; i++) {
        res-=diff[i];
    }
    cout << res+k-1;
}

컴파일 시 표준 에러 (stderr) 메시지

stove.cpp: In function 'void ccps()':
stove.cpp:22:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   22 |         freopen(NAME".inp","r",stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
stove.cpp:23:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   23 |         freopen(NAME".out","w",stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 20 / 20
• Subtask 2: 30 / 30
• Subtask 3: 50 / 50