hdu4221 greedy? (greedy)

Source: Internet
Author: User

I don't know why all the English questions ... Can't be good in Chinese ah ah ah

I saw the wrong test instructions.

#include <stdio.h> #include <algorithm>using namespace std;struct node {long long day,end;} C[100005];bool CMP (node X,node y) {if (x.end<y.end) return true;if (X.end==y.end&&x.day>y.day) return True ; return false;} int main () {int test,n,q=1;scanf ("%d", &test), while (test--) {scanf ("%d", &n), and for (int i=0;i<n;i++) scanf ("% LLD%lld ", &c[i].day,&c[i].end); sort (c,c+n,cmp); long long sum=0,max=0;for (int i=0;i<n;i++) {Sum+=c[i].day ; if (Sum-c[i].end>max) max=sum-c[i].end;} printf ("Case%d:%lld\n", Q++,max);} return 0;}

Oh, well, that's a mistake. Test instructions Even the sample can not understand


hdu4221 greedy? (greedy)

Contact Us

The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion; products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the content of the page makes you feel confusing, please write us an email, we will handle the problem within 5 days after receiving your email.

If you find any instances of plagiarism from the community, please send an email to: info-contact@alibabacloud.com and provide relevant evidence. A staff member will contact you within 5 working days.

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.