Problem in short: There are N people, and person i takes a[i], b[i] and c[i] time to do task a, b, c respectively. Only one person can do task a at a given point of time, and each person must ...
To sort the structure using std::sort function you need the bool type comparison function. By default it is for ascending order and for one value only.
Suppose you have structure:
struct data{int a,b,c;}
And you want to sort the structure in Descending order of value c. So you boolean function cmp will be:
bool cmp (data x, data y) {if(x.c > y.c) return true;else return false;}
You can also write it directly as:
bool cmp(data x, data y) {return x.c > y.c;
Problem in short: There are N people, and person i takes a[i], b[i] and c[i] time to do task a, b, c respectively. Only one person can do task a at a given point of time, and each person must ...
C++ Solution:
#include <bits/stdc++.h>using namespace std;struct data {int a,b,c;int sum;};bool cmp(data a1, data b1) {return a1.sum > b1.sum;}int main(){ios_base::sync_with_stdio(false);cin.tie(NULL);int n;cin>>n;vector<data> v(n);int x,y,z;for(int i=0;i<n;i++) {cin>>v[i].a>>v[i].b>>v[i].c;v[i].sum = v[i].b+v[i].c;}sort(v.begin(),v.end(),cmp);
Zonal Computing Olympiad is round 1 out of 3 (i.e. beginner) for selection into Indian IOI team.
C++ solution
#include <bits/stdc++.h>using namespace std;int main(){ios_base::sync_with_stdio(false);cin.tie(NULL);int n,k;cin>>n>>k;vector<int> v(n);int temp;for(int i=0;i<n;i++) {cin>>temp;v[i] = temp;}sort(v.begin(),v.end());int ans = 0;for(int i=0;i<n;i++) {temp = lower_bound(v.begin(),v.end(),v[i]+k) - v.begin();//cout<<temp<<"\n";ans += n - temp;}cout<<ans;
Notes: This problem needs input-output optimization to run in time. If you are using C++ and you use cin to get your input, add these two lines to the beginning of the main function. You don't need to do anything if you use scanf.
ios_base::sync_with_stdio(false);
C++ Solution:
#include <bits/stdc++.h>using namespace std;int main(){ios_base::sync_with_stdio(false);cin.tie(NULL);int m;cin>>m;vector<int> p(m);int a,b;for(int i=0;i<m;i++) {cin>>a>>b;p[i] = min(a,b);}sort(p.begin(),p.end());int ans = 0;for(int i=0;i<m;i++) {if(p[i]>ans) ans++;}cout<<ans;}
Zonal Computing Olympiad is round 1 out of 3 (i.e. beginner) for selection into Indian IOI team.
Any help on this? Fails on task#10 only.
#include <bits/stdc++.h>using namespace std;int main(){int n,k;cin>>n>>k;vector<int> A(n+1);vector<int> B(n+1);for(int i=1;i<=n;i++)cin>>A[i];for(int i=1;i<=n;i++)cin>>B[i];sort(A.begin()+1,A.end());sort(B.begin()+1,B.end());if(k==0) {cout<<A[n]+B[n];return 0;}int sum = INT_MAX;int maxa=A[n],maxb=B[n];for(int i=0;i<k;i++) {maxa = max(maxa,B[n-i]);
