# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
501936 | alexdd | Knapsack (NOI18_knapsack) | C++17 | 134 ms | 3752 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<iostream>
#include<algorithm>
using namespace std;
struct element
{
int v,w,k;
};
element num[1000001],newv[1000001];
int dp[1000001],dp2[1000001];
bool fr[2001];
bool cmp(element x, element y)
{
if(x.w<y.w)
return 1;
if(y.w<x.w)
return 0;
if(x.v<y.v)
return 0;
if(y.v<x.v)
return 1;
return 0;
}
int main()
{
int s,n;
cin>>s>>n;
for(int i=0;i<n;i++)
{
cin>>num[i].v>>num[i].w>>num[i].k;
fr[num[i].w]=1;
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |