-
Notifications
You must be signed in to change notification settings - Fork 2
/
Copy pathSortGame.cpp
64 lines (49 loc) · 1.18 KB
/
SortGame.cpp
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
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
#include <iostream>
#include <string>
#include <algorithm>
// first create string then tokenise it into pair and
// then run sort don't use shortcut to implement this
// shortcut is in comments
using namespace std;
int main() {
#ifndef ONLINE_JUDGE
// for getting input from input.txt
freopen("input.txt", "r", stdin);
// for writing output to output.txt
freopen("output.txt", "w", stdout);
#endif
return 0;
}
// #include<iostream>
// #include<algorithm>
// using namespace std;
// bool mycompare(pair<string,int>p1,pair<string,int>p2)
// {
// if(p1.second==p2.second)
// {
// return p1.first<p2.first;
// }
// return p1.second>p2.second;
// }
// int main()
// {
// int n,min_sal;
// cin>>min_sal;
// cin>>n;
// pair<string,int>emp[10005];
// string name;
// int salary;
// for(int i=0;i<n;i++){
// cin>>name>>salary;
// emp[i].first=name;
// emp[i].second=salary;
// }
// sort(emp,emp+n,mycompare);
// for(int i=0;i<n;i++){
// if(emp[i].second>=min_sal)
// {
// cout<<emp[i].first<<" "<<emp[i].second<<endl;
// }
// }
// return 0;
// }