제출 #447709

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
447709		LptN21	Knapsack (NOI18_knapsack)	C++14	12 / 100	1 ms	304 KiB

knapsack

#include <bits/stdc++.h>
using namespace std;
#define fastIO ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL);
#define FF first
#define SS second
#define pb push_back
#define sz(x) (int)x.size()
#define PI acos(-1.0)
#define lb lower_bound
#define ub upper_bound
#define all(a) (a).begin(), (a).end()
#define odd(x) __builtin_parity((int)x)
#define cntbit(x) __builtin_popcount(x)
typedef long long ll;
typedef pair<int, int> ii;
const int N = 1e5+7, M=5;
const int MOD = 998244353;
const int oo = 1e9;

int n, m, k, t;

struct Item{
    int w, v, k;
    Item() {}
    bool operator<(const Item &a) {return v*a.w - a.v*w<0;}
} a[N];

signed main() {
    //freopen("test.inp", "r", stdin);
    //freopen("test.out", "w", stdout);
    //fastIO;
    scanf("%d%d", &m, &n); int ans=0, sum=m;
    for(int i=1;i<=n;i++) scanf("%d%d%d", &a[i].v, &a[i].w, &a[i].k);
    sort(a+1, a+n+1);
    for(int i=n;i>0;i--) while(sum>=a[i].w&&a[i].k)
        sum-=a[i].w, a[i].k--, ans+=a[i].v;
    printf("%d", ans);
    return 0;
}
/* stuff you should look for
    - int overflow, array bounds
    - special cases (n=1?)
    - do smth instead of do nothing and stay organized
    - WRITE STUFF DOWN
    - DONT JUST STICK ON ONE APPROACH
*/

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

knapsack.cpp: In function 'int main()':
knapsack.cpp:32:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   32 |     scanf("%d%d", &m, &n); int ans=0, sum=m;
      |     ~~~~~^~~~~~~~~~~~~~~~
knapsack.cpp:33:32: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   33 |     for(int i=1;i<=n;i++) scanf("%d%d%d", &a[i].v, &a[i].w, &a[i].k);
      |                           ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 12 / 12
• Subtask 2: 0 / 17
• Subtask 3: 0 / 20
• Subtask 4: 0 / 24
• Subtask 5: 0 / 27