Submission #477517

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
477517	2021-10-02 11:29:08	hjc4vr	Studentsko (COCI14_studentsko)	C++14	Compilation error	0 ms	0 KiB

studentsko

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <iostream>
#include <queue>
#include <stack>
#include <deque>
#include <set>
#include <vector>
#include <map>
#define int long long
using namespace std;
int ft[5005];
int query(int x){
    int ans=0;
    for (;x!=0;x-=x&(-x)) ans = max(ft[x],ans);
    return ans;
}
void insert(int x,int val){
    for (;x<=5004;x+=x&(-x)) ft[x] = val;
}
bool s(pair<int,int> &a,pair<int,int> &b){
    if (a.first < b.first){
        return true;
    }
    else if (a.first == b.first){
        return a.second < b.second;
    }else{
        return false;
    }
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

Compilation message (stderr)

studentsko.cpp: In function 'int32_t main()':
studentsko.cpp:41:5: error: 'sort' was not declared in this scope; did you mean 'qsort'?
   41 |     sort(arr+1,arr+n+1);
      |     ^~~~
      |     qsort