# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1147266 | AlgorithmWarrior | Art Exhibition (JOI18_art) | C++20 | 352 ms | 8240 KiB |
#include <bits/stdc++.h>
using namespace std;
int const MAX=5e5+5;
struct art{
long long val;
long long sz;
bool operator<(art ot){
return sz<ot.sz;
}
}v[MAX];
int n;
void read(){
cin>>n;
int i;
for(i=1;i<=n;++i)
cin>>v[i].sz>>v[i].val;
sort(v+1,v+n+1);
}
void maxself(long long& x,long long val){
if(x<val)
x=val;
}
long long solve(){
int i;
long long rasp=v[1].val;
# | 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... |