# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
5405 | gs12006 | Trading (IZhO13_trading) | C++98 | 0 ms | 2624 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 <stdio.h>
#include<queue>
#include <algorithm>
using namespace std;
priority_queue< pair<int,pair<int,pair<int,pair<int,int> > > > > st;
struct mc
{
int x,n,h,t,e;
}a[66000];
bool cmp(mc x,mc y)
{
if (x.x==y.x) return x.t<y.t;
else return x.x<y.x;
}
int c[33000];
int main()
{
freopen("trading.in","r",stdin);
freopen("trading.out","w",stdout);
int n,m,ts,te,th,i,rs=1,j;
mc tmc;
scanf("%d %d",&n,&m);
for (i=0;i<m;i++)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |